Download:
by Radha Jagadeesan, Pasquale Malacaria
http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/pcf.pdf
Add To MetaCart
Abstract:
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain “history-free ” strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that it satisfies some striking properties, such that the intrinsic preorder on function types coincides with the pointwise preorder. We then obtain an order-extensional fully abstract model of PCF by quotienting the intensional model by the intrinsic preorder. This is the first syntax-independent description of the fully abstract model for PCF. (Hyland and Ong have obtained very similar results by a somewhat different route, independently and at the same time). We then consider the effective version of our model, and prove a Universality Theorem: every element of the effective extensional model is definable in PCF. Equivalently, every recursive strategy is definable up to
Citations
|
2677
|
Communicating Sequential Processes
– Hoare
- 1995
|
|
724
|
Introduction to lattices and order
– Davey, Priestley
- 1990
|
|
332
|
D.: LCF considered as a programming language
– Plotkin
- 1977
|
|
112
|
The Lambda Calculus, its Syntax and Semantics. North-Holland, 2nd edition
– Barendregt
- 1984
|
|
103
|
Fully Abstract Models of Typed Lambda-Calculi
– Milner
- 1977
|
|
100
|
Towards a geometry of interaction
– Girard
- 1989
|
|
77
|
Sequential algorithms on concrete data structures
– Berry, Curien
- 1982
|
|
72
|
Full abstraction for PCF (extended abstract
– Abramsky, Jagadeesan, et al.
- 1994
|
|
52
|
A per model of polymorphism and recursive types
– Abadi, Plotkin
- 1990
|
|
51
|
Full abstraction for sequential languages: the state of the art
– Berry, Curien, et al.
- 1985
|
|
51
|
Hereditarily Sequential Functionals
– Nickau
- 1994
|
|
34
|
Mod`eles compl`etement ad'equats et stables des lambda-calculs typ'es. Th`ese de Doctorat d'Etat, Universit'e Paris VII
– Berry
- 1979
|
|
32
|
Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic
– Samson
- 1994
|
|
32
|
Fully abstract models of programming languages
– Stoughton
- 1988
|
|
31
|
Observable sequentiality and full abstraction
– Cartwright, Felleisen
- 1992
|
|
30
|
Kripke logical relations and PCF
– O’Hearn, Riecke
- 1995
|
|
24
|
Algebraic Theories, volume 26 of Graduate Texts in Mathematics
– Manes
- 1976
|
|
23
|
Projecting sequential algorithms on strongly stable functions
– Ehrhard
- 1996
|
|
23
|
Full Abstraction and Semantic Equivalence
– Mulmuley
- 1987
|
|
20
|
Studying the fully abstract model of PCF within its continuous function model
– Jung, Stoughton
- 1993
|
|
17
|
Non-Deterministic Games and Program Analysis: an application to security
– Malacaria, Hankin
- 1999
|
|
15
|
Logik und Agon
– Lorenzen
- 1960
|
|
12
|
Finitary PCF is undecidable
– Loader
- 1996
|
|
12
|
Ein dialogisches Konstruktivitatskriterium
– Lorenzen
- 1961
|
|
8
|
Game semantics for programming languages
– Abramsky
|
|
3
|
Dalle macchine a ambienti alla geometria dell'interazione. Unpublished manuscript
– Malacaria
- 1993
|
|
1
|
Abramsky. Proofs as processes
– Samson
- 1994
|
|
1
|
write \titlerunninghead{<(Shortened) Article Title>} in file ! 59 AJ93
– Please
- 1993
|
|
1
|
Abramsky and Guy McCusker. Game Semantics
– Samson
- 1999
|
|
1
|
Crole. Categories for Types
– Roy
- 1994
|
|
1
|
Blass games and sequentiality for objects of finite type. Unpublished manuscript
– Dialogues
- 1993
|
