HoTT / coqLinks
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
☆27Updated last year
Alternatives and similar repositories for coq
Users that are interested in coq are comparing it to the libraries listed below
Sorting:
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆57Updated 11 years ago
- The mathematical study of type theories, in univalent foundations☆117Updated 7 months ago
- Development of the univalent foundations of mathematics in Coq☆18Updated 13 years ago
- Perfectoid spaces in the Lean formal theorem prover.☆127Updated last year
- LaTeX version of Grothendieck's Pursuing Stacks☆51Updated 3 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆59Updated 2 weeks ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆245Updated 11 years ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- Mathematical Components (the Book)☆147Updated 3 weeks ago
- Homotopy theory in Coq.☆89Updated 14 years ago
- Development of homotopy type theory in Agda☆427Updated 6 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆123Updated 3 years ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆167Updated last week
- 15-819 (Homotopy Type Theory) Lecture Notes☆56Updated 5 years ago
- ☆90Updated 5 months ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Archived materials related to Homotopy Type Theory.☆12Updated 13 years ago
- An experimental category theory library for Lean☆51Updated 2 years ago
- A function definition package for Coq☆233Updated this week
- A formalization of M-types in Agda☆34Updated 5 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆230Updated last year