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 formalization of Intuitionistic Propositional Logic☆22Updated 2 months 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
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Higher Algebra with Opetopic Types☆16Updated 2 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆23Updated last year
- what I did on my holidays☆12Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆16Updated 3 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆32Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- ☆15Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- my phd thesis☆26Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago