HoTT / coq
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
- Archived materials related to Homotopy Type Theory.☆10Updated 12 years ago
- Homotopy theory in Coq.☆92Updated 14 years ago
- The mathematical study of type theories, in univalent foundations☆113Updated last month
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆54Updated 10 years ago
- Implementation of Univalence in Cubical Sets☆144Updated 9 years ago
- Development of the univalent foundations of mathematics in Coq☆18Updated 12 years ago
- A formalization of M-types in Agda☆32Updated 5 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆242Updated 10 years ago
- My basic LaTeX macros and BibTeX file.☆13Updated 2 years ago
- Cohesive type theory☆19Updated 3 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- collaboration on work in progress☆15Updated 14 years ago
- Categorical logic from a categorical point of view☆78Updated last year
- ☆84Updated 7 years ago
- Programming library for Agda☆127Updated 7 months ago
- LaTeX version of Grothendieck's Pursuing Stacks☆47Updated 3 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆120Updated 3 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆56Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Development of homotopy type theory in Agda☆423Updated 6 years ago
- Build dependency graphs between Coq objects [maintainers=@Karmaki,@ybertot]☆89Updated this week
- Perfectoid spaces in the Lean formal theorem prover.☆119Updated 8 months ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆80Updated 4 years ago
- A language based on homotopy type theory with an interval☆85Updated 9 years ago
- Algebraic Combinatorics in Coq☆38Updated 2 months ago
- An experimental category theory library for Lean☆49Updated last year
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆165Updated 4 months ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆115Updated last month
- A formal proof of the independence of the continuum hypothesis☆122Updated 7 months ago