Parametricity in an Impredicative Sort - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Parametricity in an Impredicative Sort


Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions (CIC), the underlying formal language of Coq, in which parametricity relations' codomain is the impredicative sort of propositions. To proceed, we need to refine this calculus by splitting the sort hierarchy to separate informative terms from non-informative terms. This refinement is very close to CIC, but with the property that typing judgments can distinguish informative terms. Among many applications, this natural encoding of parametricity inside CIC serves both theoretical purposes (proving the independence of propositions with respect to the logical system) as well as practical aspirations (proving properties of finite algebraic structures). We finally discuss how we can simply build, on top of our calculus, a new reflexive Coq tactic that constructs proof terms by parametricity.
Fichier principal
Vignette du fichier
paramath.pdf (235.74 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00730913 , version 1 (27-09-2012)



Chantal Keller, Marc Lasson. Parametricity in an Impredicative Sort. CSL - 26th International Workshop/21st Annual Conference of the EACSL - 2012, Sep 2012, Fontainebleau, France. pp.381-395, ⟨10.4230/LIPIcs.CSL.2012.399⟩. ⟨hal-00730913⟩
469 View
403 Download



Gmail Facebook X LinkedIn More