Coq-HoTT
Homotopy Type Theory Library
A Coq library for interpreting Martin-Löf's intensional type theory into abstract homotopy theory and relating it to higher category theory.
A Coq library for Homotopy Type Theory
1k stars
59 watching
194 forks
Language: Coq
last commit: 5 days ago
Linked from 3 awesome lists
homotopy-type-theorytype-theoryunivalent-foundations
Related projects:
Repository | Description | Stars |
---|---|---|
uds-psl/mpctt | A research project on using the Coq proof assistant to develop and prove mathematical models of computation in computational type theory | 82 |
jwiegley/category-theory | An axiomatic formalization of category theory in Coq for personal study and practical work | 759 |
hivert/coq-combi | An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
geohot/coq-hardy | Formalizing mathematical theorems from Hardy's book in Coq to create a rigorous and reproducible formalization of number theory | 53 |
mgrabovsky/fm-notes | A collection of notes and resources on formal methods, type theory, and theorem proving using Coq. | 21 |
coq-community/graph-theory | Formalized graph theory results for research and verification | 35 |
andrejbauer/homotopy-type-theory-course | Teaching materials and resources for a doctoral course on homotopy theory and type theory | 287 |
amintimany/categories | An implementation of category theory in the Coq proof assistant. | 94 |
coq-community/topology | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
affeldt-aist/infotheo | A formalization of information theory and linear error-correcting codes in Coq. | 64 |
jozefg/learn-tt | A collection of resources for learning type theory and related fields | 2,180 |
vrahli/nuprlincoq | Formalizes Nuprl's Constructive Type Theory in Coq, focusing on its computation system, type system, inference rules, and consistency. | 44 |
math-comp/abel | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |
namin/dot | Mechanized proof of soundness for a type-theoretic foundation for languages like Scala | 155 |