dlicata335 / cart-cubeLinks
Cartesian Cubical Type Theory
☆71Updated 4 years ago
Alternatives and similar repositories for cart-cube
Users that are interested in cart-cube are comparing it to the libraries listed below
Sorting:
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A formalization of M-types in Agda☆34Updated 5 years ago
- ☆84Updated 8 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years 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
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated 11 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 10 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago