Cumulative Inductive Types in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Cumulative Inductive Types in Coq


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), Type 0 : Type 1 : · · ·. Such type systems are called cumulative if for any type A we have that A : Type i implies A : Type i+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.
Fichier principal
Vignette du fichier
LIPIcs-FSCD-2018-29.pdf (639.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01952037 , version 1 (04-01-2019)



Amin Timany, Matthieu Sozeau. Cumulative Inductive Types in Coq. FSCD 2018 - 3rd International Conference on Formal Structures for Computation and Deduction, Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.29⟩. ⟨hal-01952037⟩
137 View
344 Download



Gmail Facebook X LinkedIn More