Journal article icon

Journal article

Full abstraction for PCF

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...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1006/inco.2000.2930

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of
Radha Jagadeesan More by this author
Pasquale Malacaria More by this author
Engineering and Physical Sciences Research Council More from this funder
European Commission More from this funder
Publisher:
Academic Press
Journal:
Information and Computation Journal website
Volume:
163
Issue:
2
Pages:
409-470
Publication date:
2000-12-05
DOI:
ISSN:
0890-5401
URN:
uuid:41199322-fb8b-4704-aa1f-7bc479046a2a
Local pid:
ora:8567

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP