Journal article icon

Journal article

On full abstraction for PCF: I, II, and III

Abstract:

We present an order-extensional, order (or inequationally) fully abstract model for Scott's language PCF. The approach we have taken is very concrete and in nature goes back to S. C Kleene (1978, in “General Recursion Theory II, Proceedings of the 1977 Oslo Symposium,” North-Holland, Amsterdam) and R. O. Gandy (1993, “Dialogues, Blass Games, Sequentiality for Objects of Finite Type,” unpublished manuscript) in one tradition, and to G. Kahn and G. D. Plotkin (1993, Theoret. Com...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1006/inco.2000.2917

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Academic Press
Journal:
Information and Computation More from this journal
Volume:
163
Issue:
2
Pages:
285-408
Publication date:
2000-12-01
DOI:
ISSN:
0890-5401
Language:
English
Subjects:
UUID:
uuid:63c54392-39f3-46f1-8a68-e6ff0ec90218
Local pid:
ora:8566
Deposit date:
2014-06-10

Terms of use


Views and Downloads






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

TO TOP