• Medientyp: E-Artikel; Sonstige Veröffentlichung; Elektronischer Konferenzbericht
  • Titel: Cumulative Inductive Types In Coq
  • Beteiligte: Timany, Amin [VerfasserIn]; Sozeau, Matthieu [VerfasserIn]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/LIPIcs.FSCD.2018.29
  • Schlagwörter: Proof Assistants ; Universes ; Cumulativity ; Inductive Types ; Coq
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: 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 : *s. 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.
  • Zugangsstatus: Freier Zugang