A Presheaf Model of Parametric Type Theory
Journal article, 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.

Presheaf semantics


Type theory


Jean-Philippe Bernardy

University of Gothenburg

Thierry Coquand

University of Gothenburg

Guilhem Moulin

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Electronic Notes in Theoretical Computer Science

1571-0661 (ISSN)

Vol. 319 67-82

Subject Categories

Computer Science



More information

Latest update

8/8/2023 9