Impredicative encodings of (higher) inductive types

DOI10.1145/3209108.3209130zbMATH Open1452.03030arXiv1802.02820OpenAlexW2963511234MaRDI QIDQ5145279FDOQ5145279

Sam Speight, Steve Awodey, Jonas Frey

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)

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.

Full work available at URL: https://arxiv.org/abs/1802.02820

Recommendations

• Semantics of higher inductive types
• Constructions with non-recursive higher inductive types
• Inductive types and exact completion
• On higher inductive types in cubical type theory
• scientific article; zbMATH DE number 1088050

zbMATH Keywords

homotopy type theorysystem Finductive typesimpredicativityhigher inductive typesMartin-Löf type theoryimpredicative encodings

Mathematics Subject Classification ID

Homotopical algebra, Quillen model categories, derivators (18N40) Abstract and axiomatic homotopy theory in algebraic topology (55U35) Type theory (03B38)

Cited In (5)

• Title not available (Why is that?)
• Mathesis Universalis and Homotopy Type Theory
• Title not available (Why is that?)
• On generalized algebraic theories and categories with families
• 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)