IanOrton / cubical-topos-experimentsLinks
Agda code for experimenting with internal models of cubical type theory
☆15Updated 7 years ago
Alternatives and similar repositories for cubical-topos-experiments
Users that are interested in cubical-topos-experiments are comparing it to the libraries listed below
Sorting:
- ☆11Updated 5 years ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Higher Algebra with Opetopic Types☆16Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- ☆23Updated last year
- what I did on my holidays☆12Updated 7 years ago
- my phd thesis☆26Updated last year
- 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 polynomial model of a Martin-Löf type theory + a bit of game semantics☆32Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- The multimode presheaf proof-assistant☆37Updated 2 years ago
- ☆27Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- ☆15Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago