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.
☆26Updated 2 years ago
Alternatives and similar repositories for coq
Users that are interested in coq are comparing it to the libraries listed below
Sorting:
- The mathematical study of type theories, in univalent foundations☆118Updated 10 months ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆246Updated 11 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆57Updated 11 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆124Updated 3 years ago
- LaTeX version of Grothendieck's Pursuing Stacks☆53Updated 4 years ago
- Development of the univalent foundations of mathematics in Coq☆19Updated 13 years ago
- Homotopy theory in Coq.☆89Updated 14 years ago
- Development of homotopy type theory in Agda☆429Updated 6 years ago
- Perfectoid spaces in the Lean formal theorem prover.☆128Updated last year
- Notes on how to use the internal language of toposes in algebraic geometry☆60Updated 3 weeks ago
- Mathematical Components (the Book)☆149Updated 3 months ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆232Updated last week
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆166Updated 3 months ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆56Updated 5 years ago
- A proof assistant for general type theories☆309Updated 4 months ago
- An Experiment in Haskell Symbolic Algebra☆73Updated 13 years ago
- Archived materials related to Homotopy Type Theory.☆12Updated 13 years ago
- A function definition package for Coq☆235Updated this week
- ☆94Updated 8 months ago
- Programming library for Agda☆134Updated last year
- A formalization of M-types in Agda☆36Updated 5 years ago
- The formal proof of the Kepler conjecture☆171Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆213Updated 3 years ago
- ☆17Updated 3 months ago
- An experimental category theory library for Lean☆51Updated 2 years ago
- A library for formalizing Haskell types and functions in Coq☆171Updated 2 years ago
- Cohesive type theory☆19Updated 4 years ago
- CMU Undergrad Course☆95Updated 2 years ago
- A formalization of geometry in Coq based on Tarski's axiom system☆201Updated last month