A Presheaf Model of Parametric Type Theory
Paper i proceeding, 2015

We extend Martin-Löf's Logical Framework with special constructions and typing rules providing internalized parametricity. Compared to previous similar proposals, this version comes with a denotational semantics which is a refinement of the standard presheaf semantics of dependent type theory. Further, this presheaf semantics is a refinement of the one used to interpret nominal sets with restrictions. The present calculus is a candidate for the core of a proof assistant with internalized parametricity.


Type theory

Presheaf semantics


Jean-Philippe Bernardy

Chalmers, Data- och informationsteknik, Programvaruteknik

Thierry Coquand

Göteborgs universitet

Guilhem Moulin

Chalmers, Data- och informationsteknik, Datavetenskap

Electronic Notes in Theoretical Computer Science

1571-0661 (ISSN)

Vol. 319 67-82

The 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI).
Nijmegen, Netherlands,


Datavetenskap (datalogi)



Mer information

Senast uppdaterat