nmvdw / Three-HITs
All higher inductive types can be obtained from three simple HITs.
☆17Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for Three-HITs
- ☆11Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆18Updated 2 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 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
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- ☆17Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 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
- a version of the 2048 game for Coq☆22Updated last year
- Mtac in Agda☆28Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 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
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- Multimode simple type theory as an Agda library.☆22Updated 2 months ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago