Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Constructing quotient inductive-inductive types
Kaposi A., Kovács A., Altenkirch T. Proceedings of the ACM on Programming Languages3 (POPL):1-24,2019.Type:Article
Date Reviewed: Jul 9 2021

At the core of Martin-Löf type theory (also known as “intuitionistic type theory”) are dependent types, that is, types whose definitions depend on values; these may be used to encode logical quantification. In general, a type may represent a logical formula; the values of the type are then the possible proofs of the formula. Type theory has been developed as an alternative foundation of mathematics, but has also found practical application in advanced type systems; in particular, the languages of many proof assistants are based on type theoretical concepts.

The present paper advances the state of the art in type theory by generalizing the notions of inductive types (which provide constants and functions to construct terms of the type) and inductive-inductive types (which allow the simultaneous definition of a type and a family of types indexed over that type) to quotient inductive-inductive types (QIITs): these types simultaneously introduce multiple types where the later types can be indexed over the previous ones; furthermore, equality constructors can be used to state equalities among type constructions. The core of this paper is the definition of a type theory called “theory of signatures,” which is used to specify finitary QITTs. This theory is given a semantics by proving the existence of an initial algebra for every signature. Finally, it is shown that these algebras support the principle of induction.

While the paper is very technical in nature, an ample introduction virtuously strives to illustrate to nonexperts the core ideas via various examples of QIITs defined in the theory of signatures (however, already here, some background in type theory may be helpful). The core part of the paper is then clearly targeted to researchers in the field; even with this, to keep the paper readable, the full definitions of the main operations have been delegated to an electronic appendix. The conclusions address further work on lifting several restrictions of the theory, in particular the generalization to infinitary QIITs and the generalization to higher-order inductive-inductive types (HIITs).

Reviewer:  Wolfgang Schreiner Review #: CR147304 (2110-0252)
Bookmark and Share
  Featured Reviewer  
Would you recommend this review?
Other reviews under "General": Date
Programming language theory and its implementation
Gordon M., Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1988. Type: Book (9789780137304172)
Jul 1 1989
F# for scientists
Harrop J., Wiley-Interscience, New York, NY, 2008.  368, Type: Book (9780470242117)
Feb 5 2009
Programming in the 1990s: an introduction to the calculation of programs
Cohen E., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387973821)
Feb 1 1992

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 2004™
Terms of Use
| Privacy Policy