nmvdw / Three-HITsLinks
All higher inductive types can be obtained from three simple HITs.
☆17Updated 7 years ago
Alternatives and similar repositories for Three-HITs
Users that are interested in Three-HITs are comparing it to the libraries listed below
Sorting:
- ☆11Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 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 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 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
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- ☆16Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- An Agda formalisation of the theory of directed containers☆12Updated last month
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- ☆10Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- ☆18Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- NbE course @ Chalmers☆28Updated 8 months ago