Log In Sign Up

On completeness and parametricity in the realizability semantics of System F

by   Paolo Pistone, et al.

A general approach to the realizability semantics of System F is obtained by considering closure operators over sets of lambda-terms. We investigate completeness and relational parametricity in the semantics generated by such closure operators. We prove general results and show that they can be applied to several well-known semantics, as those arising from Tait's saturatedness conditions and from Girard's reducibility candidates. First, we show that, for a wide class of semantics, completeness holds for positive second order types, by generalizing some completeness results in the literature. Then we show that Reynolds parametric semantics can be formulated within the realizability semantics which are stable by union. We prove a parametricity theorem stating that closed realizers of a given type are parametric at that type. Finally, we consider syntactic dinaturality and prove that, for positive second order types, parametric terms are dinatural. Our results show that, for positive second order types, realizability, parametricity, dinaturality and typability are equivalent properties of closed normal lambda-terms.


page 1

page 2

page 3

page 4


On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics

We present syntactic characterisations for the union closed fragments of...

Poset products as relational models

We introduce a relational semantics based on poset products, and provide...

Complete Call-by-Value Calculi of Control Operators, I

We give new call-by-value calculi of control operators that are complete...

Reasoning about multiple aspects in DLs: Semantics and Closure Construction

Starting from the observation that rational closure has the undesirable ...

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version)

We study various formulations of the completeness of first-order logic p...

Complete and tractable machine-independent characterizations of second-order polytime

The class of Basic Feasible Functionals BFF is the second-order counterp...

A Second-Order Approach to Complex Event Recognition

Complex Event Recognition (CER for short) refers to the activity of dete...