vladimirias / Foundations
Voevodsky's original development of the univalent foundations of mathematics in Coq
☆53Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for Foundations
- HoTT in Lean 3☆75Updated 4 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆111Updated last month
- Categorical logic from a categorical point of view☆75Updated last year
- An experimental category theory library for Lean☆47Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆94Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Implementation of Univalence in Cubical Sets☆145Updated 9 years ago
- ☆77Updated last month
- Schemes in Lean (v2)☆42Updated 4 years ago
- ☆82Updated 7 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆121Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆45Updated last month
- A formalization of M-types in Agda☆32Updated 4 years ago
- Datatypes as quotients of polynomial functors☆34Updated 4 years ago
- ☆27Updated 6 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Ground Zero: Lean 4 HoTT Library☆45Updated 3 weeks ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Homotopy theory in Coq.☆90Updated 13 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆219Updated 6 months ago
- Coq plugin embedding elpi☆139Updated this week
- An Open Encyclopedia of Proof Systems☆116Updated 2 years ago