Proof that the sum one to n is n*(n+1)/2 in Coq

Sudoku in Coq

Modélisation de concepts mathématiques et raisonnements sur ces derniers.

Formal proof with the Coq theorem prover of the correctness of an oracle algorithm for offline analysis of distributed logs against interaction models

Demonstration, in Coq, that the Euclidean Algorithm can be efficiently used to compute the greatest common divisor of two numbers

Some personal notes on typical algebra topics

Machine-checked proofs of secrecy and authentication using CCSA framework

Formal proof with the Coq theorem prover of the equivalence of three semantics for a language describing the behavior of distributed systems.

COQ. Certified Programming with Dependent Types by Adam Chlipala. Exercises from the book. Solutions.

Metaprogramming in Coq

Formalization of hashtables with Radix trees and PArray in Coq

A proof of the Pigeonhole principle. The Pigeonhole principle is a fundamental theorem that is used widely in Computer Science and Combinatorics, it asserts that if you put n things into m containers, and n > m, then at least one of the containers contains more than one thing.

A proof of factorization using Takahashi's method

Certified LambdaJS semantics and interpreter.

∇⎕ coloring

Computer Scientist Degree - Thesis Work

Formalisation of Separation Logic and Mutability

Final project for master's degree in Semantics of programming languages course.

The Tortoise and the Hare in Coq. Constructive extraction via Bar inductive predicates (see README.md below).

This is a repo of my master's thesis written as part of my studies at the University of Wrocław