Parametricity in an Impredicative Sort

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00730913
Contributor : Chantal Keller <>
Submitted on : Thursday, September 27, 2012 - 12:20:20 PM
Last modification on : Wednesday, April 3, 2019 - 1:31:17 AM
Document(s) archivé(s) le : Friday, December 28, 2012 - 2:45:10 AM

Files

paramath.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

504

Files downloads

390