A framework for verification of causal consistency for distributed key-value stores and their clients in Coq [maintainer=@palmskog]
A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@anton-trunov]
Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]
Verified implementation in Coq of Buchberger's algorithm for computing Gröbner bases [maintainer=@palmskog]
A Coq library to embed Impure OCaml oracles in certified Coq code
Coq proof of Bertrand's postulate on existence of primes [maintainer=@thery]
This respository contains the formalization of different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to different sorting algorithms.
Certifying Answers of Boolean SAT-Solvers (with a proof combining Coq and OCaml typecheckers)
A Coq library to embed Impure OCaml oracles in certified Coq code
Certified implementation in Coq of Stålmarck's algorithm for proving tautologies [maintainer=@palmskog]
(Terminating) hylomorphisms in Coq
Add a description, image, and links to the coq-extraction topic page so that developers can more easily learn about it.
To associate your repository with the coq-extraction topic, visit your repo's landing page and select "manage topics."