gebner / hott3Links
HoTT in Lean 3
☆82Updated 5 years ago
Alternatives and similar repositories for hott3
Users that are interested in hott3 are comparing it to the libraries listed below
Sorting:
- Lecture notes on realizability☆75Updated 10 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆84Updated 8 years ago
- Ground Zero: Lean 4 HoTT Library☆73Updated last week
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- An experimental category theory library for Lean☆51Updated 2 years ago
- A formalization of M-types in Agda☆36Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- ☆48Updated 2 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- Datatypes as quotients of polynomial functors☆38Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Cartesian Cubical Type Theory☆71Updated 4 years ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆73Updated 2 months ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆54Updated last month
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- ☆36Updated 4 years ago
- Schemes in Lean (v2)☆44Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago