2016 · 20 citations · 10 references
Inductive TypesEngineeringAutomated ReasoningType TheoryHigher Category TheoryGeneral HitsComputer ScienceType SystemHigher ConstructorsRecursive FunctionComputability Theory
Higher inductive types (HITs) in homotopy type theory are a powerful generalization of inductive types. Not only can they have ordinary constructors to define elements, but also higher constructors to define equalities (paths). We say that a HIT H is non-recursive if its constructors do not quantify over elements or paths in H. The advantage of non-recursive HITs is that their elimination principles are easier to apply than those of general HITs.
10
Steven Awodey · Journal of Logic and Computation · 2004 · 81 citations
Constructing the propositional truncation using non-recursive HITs
2016 · 28 citations
Homotopy limits in type theory
Jeremy Avigad, Krzysztof Kapulkin, Peter LeFanu Lumsdaine · 2018 · 27 citations · Full text
Homotopy limits in type theory
Mathematical Structures in Computer Science · 2015 · 21 citations · Full text