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. ispartof: LIPIcs : Leibniz International Proceedings in Informatics ispartof: International Conference on Formal Structures for Computation and Deduction (FSCD) location:Oxford, UK date:9 Jul - 12 Jul 2018 status: accepted