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:
- 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
- ☆11Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 3 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆18Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- Category-theoretic domain theory.☆9Updated 9 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆16Updated 8 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Category theory and algebra☆28Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year