A proof of factorization using Takahashi's method
-
Updated
Jun 24, 2024 - Coq
A proof of factorization using Takahashi's method
Machine-checked proofs of secrecy and authentication using CCSA framework
COQ. Certified Programming with Dependent Types by Adam Chlipala. Exercises from the book. Solutions.
Computer Scientist Degree - Thesis Work
Formalisation of Separation Logic and Mutability
Some personal notes on typical algebra topics
Formalization of hashtables with Radix trees and PArray in Coq
Certified LambdaJS semantics and interpreter.
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
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.
A correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]
Descriptions & implementations of type-reconstruction/inference algorithms.
Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.
Coq implementations and proof scripts developed for a course in mechanical reasoning.
Formalization of Lewis Carroll syllogism from Symbolic Logic and proof it with Coqlang.
Add a description, image, and links to the coq-formalization topic page so that developers can more easily learn about it.
To associate your repository with the coq-formalization topic, visit your repo's landing page and select "manage topics."