IanOrton / cubical-topos-experiments
Agda code for experimenting with internal models of cubical type theory
☆13Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for cubical-topos-experiments
- ☆11Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆18Updated 2 years ago
- Mtac in Agda☆28Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Higher Algebra with Opetopic Types☆14Updated last year
- Relative Monad Library for Agda☆24Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- what I did on my holidays☆12Updated 6 years ago
- ☆21Updated 4 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 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- ☆12Updated 2 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- ☆12Updated 5 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆17Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago