Pure Type Systems with an Internalized Parametricity Theorem
Licentiatavhandling, 2013

Parametricity results have recently been proved for dependently-typed calculi such as the Calculus of Constructions. However these results are meta theorems, and although they can be stated as internal propositions, they cannot be proved internally. In this thesis we define for any sufficiently strong Pure Type System O (such as the Calculus of Constructions) an extension P in which each instance of the parametricity theorem, including those corresponding to open terms, can be proved internally. As a consequence we can prove inside the system that each term of type forall A. A -> A is an identity. Furthermore, our system P is proved to be strongly normalizing by a reduction-preserving interpretation into O. We also prove Church-Rosser and Subject Reduction properties; consistency follows.

Type structure

Polymorphism

Lambda Calculus.

Parametricity

room HB2, Hörsalsvägen 8, Chalmers University of Technology
Opponent: Thorsten Altenkirch

Författare

Guilhem Moulin

Chalmers, Data- och informationsteknik, Datavetenskap

A Computational Interpretation of Parametricity

IEEE Symposium on Logic in Computer Science. 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Dubrovnik, Croatia, June 25-28, 2012,; (2012)p. 135-144

Paper i proceeding

Fundament

Grundläggande vetenskaper

Ämneskategorier

Datavetenskap (datalogi)

room HB2, Hörsalsvägen 8, Chalmers University of Technology

Opponent: Thorsten Altenkirch