mikeshulman / dirttLinks
Directed type theory for formal category theory
☆17Updated 8 years ago
Alternatives and similar repositories for dirtt
Users that are interested in dirtt are comparing it to the libraries listed below
Sorting:
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Cohesive type theory☆19Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆27Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Mtac in Agda☆28Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- ☆17Updated 3 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- ☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- ☆17Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A simple GUI for Agda☆31Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Logical relations proof in Agda☆27Updated 10 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Web based opetopic editor☆35Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago