gebner / hott3Links
HoTT in Lean 3
☆80Updated 4 years ago
Alternatives and similar repositories for hott3
Users that are interested in hott3 are comparing it to the libraries listed below
Sorting:
- A (formalised) general definition of type theories☆57Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Ground Zero: Lean 4 HoTT Library☆63Updated last week
- An experimental category theory library for Lean☆51Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- ☆84Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- ☆47Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- Categorical logic from a categorical point of view☆80Updated last year
- Lecture notes on realizability☆74Updated 4 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆66Updated 8 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- A formalization of M-types in Agda☆33Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆70Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 2 weeks ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- Convert Haskell source code to Coq source code.☆85Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- H.O.T.T. using rewriting in Agda☆43Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago