Skip to main content

Research Repository

See what's under the surface

Advanced Search

Quotient inductive-inductive types

Altenkirch, Thorsten; Capriotti, Paolo; Dijkstra, Gabe; Kraus, Nicolai; Nordvall Forsberg, Fredrik

Authors

Thorsten Altenkirch txa@cs.nott.ac.uk

Paolo Capriotti paolo.capriotti@nottingham.ac.uk

Gabe Dijkstra gabe.dijkstra@gmail.com

Nicolai Kraus

Fredrik Nordvall Forsberg



Contributors

Christel Baier
Editor

Ugo Dal Lago
Editor

Abstract

Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the sense of HoTT (i.e. do not satisfy uniqueness of equality proofs) such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define sets, such as the Cauchy reals, the partiality monad, and the internal, total syntax of type theory. In each of these examples we define several types that depend on each other mutually, i.e. they are inductive-inductive definitions. We call those HITs quotient inductive-inductive types (QIITs). Although there has been recent progress on the general theory of HITs, there isn't yet a theoretical foundation of the combination of equality constructors and induction-induction, despite having many interesting applications. In the present paper we present a first step towards a semantic definition of QIITs. In particular, we give an initial-algebra semantics and show that this is equivalent to the section induction principle, which justifies the intuitively expected elimination rules.

Start Date Apr 14, 2018
Publication Date 2018
Publisher Springer Publishing Company
Peer Reviewed Peer Reviewed
Pages 293-310
Series Title Lecture notes in computer science
Series Number 10803
Book Title FoSSaCS 2018: Foundations of Software Science and Computation Structures
ISBN 9783319893655
APA6 Citation Altenkirch, T., Capriotti, P., Dijkstra, G., Kraus, N., & Nordvall Forsberg, F. (2018). Quotient inductive-inductive types. In C. Baier, & U. Dal Lago (Eds.), FoSSaCS 2018: Foundations of Software Science and Computation Structures. , (293-310). Cham: Springer Publishing Company. https://doi.org/10.1007/978-3-319-89366-2_16
DOI https://doi.org/10.1007/978-3-319-89366-2_16
Keywords Logic in Computer Science;
Publisher URL https://link.springer.com/chapter/10.1007/978-3-319-89366-2_16
Copyright Statement Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by/4.0

Files

978-3-319-89366-2_16.pdf (329 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by/4.0






You might also like



Downloadable Citations

;