| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421623 | Electronic Notes in Theoretical Computer Science | 2015 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
