AbstractSieber has described a model of PCF consisting of continuous functions that are invariant under certain (finitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of "Kripke logical relations" introduced by Jung and Tiuryn to characterize λ-definability
ion for PCF Preliminary Announcement Martin Hyland and Luke Ong 26th July 1993 This note is (inte...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
AbstractWe define a notion of Kripke logical predicate for models of classical linear logic. A Kripk...
AbstractSieber has described a model of PCF consisting of continuous functions that are invariant un...
Sieber has described a model of PCF consisting of continuous functions that are invariant under cert...
Sieber has described a model of PCF consisting of continuous functions that are invariant under cert...
The material presented here is an exposition of an application of logical relations to the problem o...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
An intensional model for the programming language PCF is described in which the types of PCF are int...
Abstract. We apply logical relations to define two hierarchies of functionals in all finite types as...
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the...
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the...
In the course of extending Ahmed and Blume’s recent work on fully abstract CPS translation to a lang...
We show that the poset of degrees of relative definability in the Scott model of Unary PCF is non tr...
ion for PCF Samson Abramsky y Radha Jagadeesan z Pasquale Malacaria x December 1, 1995 Abstra...
ion for PCF Preliminary Announcement Martin Hyland and Luke Ong 26th July 1993 This note is (inte...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
AbstractWe define a notion of Kripke logical predicate for models of classical linear logic. A Kripk...
AbstractSieber has described a model of PCF consisting of continuous functions that are invariant un...
Sieber has described a model of PCF consisting of continuous functions that are invariant under cert...
Sieber has described a model of PCF consisting of continuous functions that are invariant under cert...
The material presented here is an exposition of an application of logical relations to the problem o...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
An intensional model for the programming language PCF is described in which the types of PCF are int...
Abstract. We apply logical relations to define two hierarchies of functionals in all finite types as...
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the...
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the...
In the course of extending Ahmed and Blume’s recent work on fully abstract CPS translation to a lang...
We show that the poset of degrees of relative definability in the Scott model of Unary PCF is non tr...
ion for PCF Samson Abramsky y Radha Jagadeesan z Pasquale Malacaria x December 1, 1995 Abstra...
ion for PCF Preliminary Announcement Martin Hyland and Luke Ong 26th July 1993 This note is (inte...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
AbstractWe define a notion of Kripke logical predicate for models of classical linear logic. A Kripk...
DOI
Add to ORKG