mortberg / gen-cartLinks
A Unifying Cartesian Cubical Set Model
☆35Updated 6 years ago
Alternatives and similar repositories for gen-cart
Users that are interested in gen-cart are comparing it to the libraries listed below
Sorting:
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An enhanced unification algorithm for Coq☆58Updated 2 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆38Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- my phd thesis☆26Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Revised Omega-categorical Typechecker☆27Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago