On Full Abstraction for PCF: I, II, and III

  title={On Full Abstraction for PCF: I, II, and III},
  author={Martin Hyland and C.-H. Luke Ong},
  journal={Inf. Comput.},
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,'' NorthHolland, 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. Comput. Sci. 121… CONTINUE READING
Highly Influential
This paper has highly influenced 71 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 763 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
443 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 443 extracted citations

764 Citations

Citations per Year
Semantic Scholar estimates that this publication has 764 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…