Benutzer: Gast  Login
Dokumenttyp:
Technical Report 
Autor(en):
Kalyan Basu 
Titel:
The Geometry of Sequential Computation II: Full abstraction for PCF 
Abstract:
In this study, our earlier work on the representation of linear (MELL) proofs using affine simplices is used to develop an approach to a certain version of the problem of full abstraction for a denotational semantics for PCF. We stay as far as possible, within the classical ideas of Scott, Berry and others, by conceiving our denotational space essentially as a certain kind of topological space (specifically, a consistently complete, algebraic cpo); the generalization we use, is to look at this...    »
 
Stichworte:
Simplex; Dialogue; Sequential Realizability; Definability; Order-extensionality; Free interpretation; Full abstraction 
Jahr:
1997 
Jahr / Monat:
1997-08-01 00:00:00 
Seiten/Umfang:
18