gebner / hott3Links
HoTT in Lean 3
☆80Updated 5 years ago
Alternatives and similar repositories for hott3
Users that are interested in hott3 are comparing it to the libraries listed below
Sorting:
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- An experimental category theory library for Lean☆51Updated last year
- A (formalised) general definition of type theories☆57Updated 4 years ago
- ☆84Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Ground Zero: Lean 4 HoTT Library☆64Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- Lecture notes on realizability☆74Updated 6 months ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- A formalization of M-types in Agda☆34Updated 5 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- ☆47Updated 2 years ago
- Cartesian Cubical Type Theory☆71Updated 4 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 10 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- Categorical logic from a categorical point of view☆80Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- apkg - package manager for Agda☆38Updated 4 years ago