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.
Formalization in Coq of a simply typed λ-calculus extended with records and subtyping.
Demonstration, in Coq, that the Euclidean Algorithm can be efficiently used to compute the greatest common divisor of two numbers
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."