Impredicative encodings of (higher) inductive types
DOI10.1145/3209108.3209130zbMATH Open1452.03030arXiv1802.02820OpenAlexW2963511234MaRDI QIDQ5145279FDOQ5145279
Authors: Jonas Frey, Sam Speight, Steve Awodey
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.02820
Recommendations
homotopy type theorysystem Finductive typesimpredicativityhigher inductive typesMartin-Löf type theoryimpredicative encodings
Homotopical algebra, Quillen model categories, derivators (18N40) Abstract and axiomatic homotopy theory in algebraic topology (55U35) Type theory (03B38)
Cited In (6)
- Mathesis Universalis and Homotopy Type Theory
- Constructing higher inductive types as groupoid quotients
- Title not available (Why is that?)
- On generalized algebraic theories and categories with families
- Impredicative encodings of inductive-inductive data in Cedille
- For Finitary Induction-Induction, Induction is Enough
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)