Impredicative encodings of (higher) inductive types
From MaRDI portal
Publication:5145279
Abstract: Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant {eta}-equalities and consequently do not admit dependent eliminators. To recover {eta} and dependent elimination, we present a method to construct refinements of these impredicative encodings, using ideas from homotopy type theory. We then extend our method to construct impredicative encodings of some higher inductive types, such as 1-truncation and the unit circle S1.
Recommendations
Cited in
(6)- Mathesis Universalis and Homotopy Type Theory
- Constructing higher inductive types as groupoid quotients
- scientific article; zbMATH DE number 7561492 (Why is no real title available?)
- Impredicative encodings of inductive-inductive data in Cedille
- For Finitary Induction-Induction, Induction is Enough
- On generalized algebraic theories and categories with families
This page was built for publication: Impredicative encodings of (higher) inductive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145279)