Cumulative Inductive Types In Coq


Amin Timany and Matthieu Sozeau: Cumulative Inductive Types In Coq. In 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 2018. https://doi.org/10.4230/LIPIcs.FSCD.2018.29
Conference Paper
Keywords: Coq, Proof Assistants, Inductive Types, Universes, Cumulativity
Abstract.

In order to avoid well-known paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type0 : Type1 : ···. Such type systems are called cumulative if for any type A we have that A : Typei implies A : Typei+1. The Predicative Calculus of Inductive Constructions (pCIC) which forms the basis of the Coq proof assistant, is one such system. In this paper we present the Predicative Calculus of Cumulative Inductive Constructions (pCuIC) which extends the cumulativity relation to inductive types. We discuss cumulative inductive types as present in Coq 8.7 and their application to formalization and definitional translations.

The bibtex source for this publication:
@inproceedings{DBLP:conf/rta/TimanyS18,
  author    = {Amin Timany and
               Matthieu Sozeau},
  title     = {Cumulative Inductive Types In Coq},
  booktitle = {3rd International Conference on Formal Structures for Computation
               and Deduction, {FSCD} 2018, July 9-12, 2018, Oxford, {UK}},
  pages     = {29:1--29:16},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.FSCD.2018.29},
  doi       = {10.4230/LIPIcs.FSCD.2018.29},
  timestamp = {Thu, 02 May 2019 17:40:19 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/rta/TimanyS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}