All higher inductive types can be obtained from three simple HITs.
☆17Apr 6, 2018Updated 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:
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated 10 months ago
- ☆45Jun 20, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Partial combinatory algebras and realizability interpretations of arithmetic, in Coq.☆13Mar 28, 2017Updated 8 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- ☆10May 3, 2017Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- what I did on my holidays☆12Jul 9, 2018Updated 7 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Apr 29, 2021Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆45Sep 10, 2020Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Conference on Homotopy Type Theory 2019☆16Sep 18, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago