Quotient inductive-inductive types

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Citations (Scopus)

Abstract

Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types with non-trivial higher equality types, such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define types satisfying uniqueness of equality proofs, such as the Cauchy reals, the partiality monad, and the well-typed 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 a general theory of HITs, there is not yet a theoretical foundation for the combination of equality constructors and induction-induction, despite 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. We further derive a section induction principle , stating that every algebra morphism into the algebra in question has a section, which is close to the intuitively expected elimination rules.
LanguageEnglish
Title of host publicationFoundations of Software Science and Computation Structures
Subtitle of host publication21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings
EditorsChristel Baier, Ugo Dal Lago
Place of PublicationCham
Pages293-310
Number of pages18
DOIs
Publication statusPublished - 14 Apr 2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume10803
ISSN (Print)0302-9743

Fingerprint

Algebra
Semantics

Keywords

  • higher inductive types
  • qotient inductive-inductive types
  • homotopy type theory
  • algebra

Cite this

Altenkirch, T., Capriotti, P., Dijkstra, G., Kraus, N., & Nordvall Forsberg, F. (2018). Quotient inductive-inductive types. In C. Baier, & U. Dal Lago (Eds.), Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings (pp. 293-310). (Lecture Notes in Computer Science; Vol. 10803). Cham. https://doi.org/10.1007/978-3-319-89366-2
Altenkirch, Thorsten ; Capriotti, Paolo ; Dijkstra, Gabe ; Kraus, Nicolai ; Nordvall Forsberg, Fredrik. / Quotient inductive-inductive types. Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings. editor / Christel Baier ; Ugo Dal Lago. Cham, 2018. pp. 293-310 (Lecture Notes in Computer Science).
@inproceedings{3b4083d507d548fc890ab268465d90fe,
title = "Quotient inductive-inductive types",
abstract = "Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types with non-trivial higher equality types, such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define types satisfying uniqueness of equality proofs, such as the Cauchy reals, the partiality monad, and the well-typed 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 a general theory of HITs, there is not yet a theoretical foundation for the combination of equality constructors and induction-induction, despite 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. We further derive a section induction principle , stating that every algebra morphism into the algebra in question has a section, which is close to the intuitively expected elimination rules.",
keywords = "higher inductive types, qotient inductive-inductive types, homotopy type theory, algebra",
author = "Thorsten Altenkirch and Paolo Capriotti and Gabe Dijkstra and Nicolai Kraus and {Nordvall Forsberg}, Fredrik",
year = "2018",
month = "4",
day = "14",
doi = "10.1007/978-3-319-89366-2",
language = "English",
isbn = "978-3-319-89365-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin Heidelberg",
pages = "293--310",
editor = "Christel Baier and {Dal Lago}, Ugo",
booktitle = "Foundations of Software Science and Computation Structures",

}

Altenkirch, T, Capriotti, P, Dijkstra, G, Kraus, N & Nordvall Forsberg, F 2018, Quotient inductive-inductive types. in C Baier & U Dal Lago (eds), Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings. Lecture Notes in Computer Science, vol. 10803, Cham, pp. 293-310. https://doi.org/10.1007/978-3-319-89366-2

Quotient inductive-inductive types. / Altenkirch, Thorsten; Capriotti, Paolo; Dijkstra, Gabe; Kraus, Nicolai; Nordvall Forsberg, Fredrik.

Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings. ed. / Christel Baier; Ugo Dal Lago. Cham, 2018. p. 293-310 (Lecture Notes in Computer Science; Vol. 10803).

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Quotient inductive-inductive types

AU - Altenkirch, Thorsten

AU - Capriotti, Paolo

AU - Dijkstra, Gabe

AU - Kraus, Nicolai

AU - Nordvall Forsberg, Fredrik

PY - 2018/4/14

Y1 - 2018/4/14

N2 - Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types with non-trivial higher equality types, such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define types satisfying uniqueness of equality proofs, such as the Cauchy reals, the partiality monad, and the well-typed 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 a general theory of HITs, there is not yet a theoretical foundation for the combination of equality constructors and induction-induction, despite 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. We further derive a section induction principle , stating that every algebra morphism into the algebra in question has a section, which is close to the intuitively expected elimination rules.

AB - Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types with non-trivial higher equality types, such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define types satisfying uniqueness of equality proofs, such as the Cauchy reals, the partiality monad, and the well-typed 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 a general theory of HITs, there is not yet a theoretical foundation for the combination of equality constructors and induction-induction, despite 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. We further derive a section induction principle , stating that every algebra morphism into the algebra in question has a section, which is close to the intuitively expected elimination rules.

KW - higher inductive types

KW - qotient inductive-inductive types

KW - homotopy type theory

KW - algebra

UR - http://www.springer.com/gb/book/9783319893655

U2 - 10.1007/978-3-319-89366-2

DO - 10.1007/978-3-319-89366-2

M3 - Conference contribution book

SN - 978-3-319-89365-5

T3 - Lecture Notes in Computer Science

SP - 293

EP - 310

BT - Foundations of Software Science and Computation Structures

A2 - Baier, Christel

A2 - Dal Lago, Ugo

CY - Cham

ER -

Altenkirch T, Capriotti P, Dijkstra G, Kraus N, Nordvall Forsberg F. Quotient inductive-inductive types. In Baier C, Dal Lago U, editors, Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings. Cham. 2018. p. 293-310. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-89366-2