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

Information and Computation

Volumn 163, Issue 2, 2000, Pages 285-408

  Hyland, J M E ^a   Ong, C H L ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Full abstraction; Game semantics; Higher type sequential computation; PCF; calculus

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS; SEMANTICS;

RECURSION THEORY;

GAME THEORY;

EID: 0034672932     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2917     Document Type: Article

References (83)

1. Abramsky, S. (1997), Semantics of interaction: an introduction to game semantics, in "Semantics and Logics of Computation," pp. 1-32, Cambridge Univ. Press, Cambridge, UK.
2. Abramsky, S., and Jagadeesan, R. (1994), Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59, 543-574.
3. Abramsky, S., Jagadeesan, R., and Malacaria, P. (1994), Full abstraction for PCF (extended abstract), in "Theoretical Aspects of Computer Software: TACS'94, Sendai, Japan," pp. 1-15, Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin/New York.
4. Abramsky, S., and Ong, C.-H. L. (1993), Full abstraction in the lazy lambda calculus, Inform. and Comput 105, 159-267.
5. Alimohamed, M. (1994), A characterization of lambda definability in categorical models of implicit polymorphism, Theoret. Comput. Sci. 146, 5-23.
6. Barendregt, H. (1984), "The Lambda Calculus," North-Holland, Amsterdam, revised edition.
7. Benton, P. N., Bierman, G. M., de Paiva, V. C. V., and Hyland, J. M. E. (1992), "Term Assignment for Intuitionistic Linear Logic," Technical Report 262, Computer Laboratory, University of Cambridge.
8. Berry, G. (1978), Stable models of typed lambda calculus, in "Proc. 5th Colloquium on Algorithms, Languages and Programming," Lecture Notes in Computer Science, Vol. 62, Springer-Verlag, Berlin/New York.
9. Berry, G. (1981), "Some Syntactic and Categorical Constructions of Lambda Calculus Models," Rapport de Recherche 80, Institute National de Recherche en Informatique et en Automatique (INRIA).
10. Berry, G., and Curien, P.-L. (1982), Sequential algorithms on concrete data structures, Theoret. Comput. Sci. 20, 265-321.
11. Berry, G., Curien, P.-L., and Lévy, J.-J. (1986), Full abstraction for sequential languages: the state of the art, in "Algebraic Semantics" (M. Nivat and J. Reynolds, Eds.), pp. 89-132, Cambridge University Press, Cambridge, UK.
12. Bierman, G. M. (1994), "On Intuitionistic Linear Logic," Ph.D. thesis, Computer Laboratory, University of Cambridge.
13. Blass, A. (1992), A game semantics for linear logic, Ann. Pure Appl. Logic 56, 183-220.
14. Brookes, S., and Geva, S. (1992), "Stable and Sequential Functions on Scott Domains," Technical Report CMU-CS-92-121, School of Computer Science, Carnegie Mellon University.
15. Bucciarelli, A. (1993), "Sequential Models of PCF: Some Contributions to the Domain-Theoretic Approach to Full Abstraction," Ph.D. thesis, Dipartimento di Informatica, Università di Pisa.
16. Bucciarelli A., and Ehrhard, T. (1991), Sequentiality and strong stability, in "Proc. 6th Annual IEEE Symp. Logic in Computer Science," pp. 138-145, IEEE Computer Society Press, Los Alamitos, CA.
17. Bucciarelli A., and Ehrhard, T. (1993), A theory of sequentiality, Theoret. Comput. Sci. 113, 273-292.
18. Cartwright, R., Curien, P.-L., and Felleisen, M. (1994), Fully abstract semantics for observably sequential languages, Inform. and Comput. 111, 297-401.
19. Cartwright, R., and Felleisen, M. (1992), Observable sequentiality and full abstraction (preliminary version), in "Proc. 19th ACM Symp. Principles of Programming Languages," pp. 328-342, Assoc. Comput. Mach., New York.
20. Church, A. (1940), A formulation of the simple theory of types, J. Symbolic Logic 5, 56-68.
21. Crole, R. L. (1993), "Categories for Types," Cambridge University Press, Cambridge, UK.
22. Curien, P.-L. (1992), Observable algorithms on concrete data structures, in "Proc. 7th IEEE Symp. Logic in Computer Science," pp. 432-443, IEEE Computer Society Press, Los Alamitos, CA.
23. Curien, P.-L. (1992), Sequentiality and full abstraction, in "Applications of Categories in Computer Science" (M. P. Fourman et al., Eds.), pp. 66-94, Cambridge University Press, Cambridge, UK.
24. Curien, P.-L. (1993), "Categorical Combinators, Sequential Algorithms, and Functional Programming," 2nd ed., Progress in Theoretical Computer Science Series, Birkhauser, Basel.
25. Curien, P.-L. (1994), "Coherence Bistructures," unpublished manuscript, Beijing.
26. Ehrhard, T. (1993), Hypercoherences: a strongly stable model of linear logic, Math. Structures Comput. Sci. 3, 365-385.
27. Ehrhard, T. (1994), Projecting sequential algorithms on strongly stable functions, J. Pure Appl. Logic, to appear.
28. Felscher, W. (1986), Dialogues as a foundation for intuitionistic logic, in "Handbook of Philosophical Logic" (D. Gabbay and F. Guenthner, Eds.), Vol. III, pp. 341-372, Reidel, Dordrecth/Norwell, MA.
29. Gandy, R. O. (1967), Computable functionals of finite type I, in "Sets, Models and Recursion Theory" (J. N. Crossley, Eds.), North-Holland, Amsterdam.
30. Gandy, R. O. (1993), "Dialogues, Blass Games, Sequentiality for Objects of Finite Type," unpublished manuscript.
31. Girard, J.-Y. (1972), "Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur," Thèse de Doctorat d'Etat, Paris.
32. Gödel, K. (1958), Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, 280-287.
33. Gödel, K. (1990), "Kurt Gödel Collected Works" (S. Feferman et al., Eds.), Vol. I and II, Oxford Univ. Press, Oxford.
34. Gunter, C. A. (1992), "Semantics of Programming Languages: Structures and Techniques," MIT Press, Cambridge, MA.
35. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall, Englewood Cliffs, MA.
36. Howe, D. J. (1989), Equality in lazy computation systems, in "Proc. 4th IEEE Symp. Logic in Computer Science," pp. 198-203, Computer Society Press, New York.
37. Hyland, J. M. E. (1976), A syntactic characterization of the equality in some models of the lambda calculus, J. London Math. Soc. (2) 12, 361-370.
38. Hyland, J. M. E. (1997), Game Semantics, in "Semantics and Logics of Computation," pp. 131-182, Cambridge Univ. Press, Cambridge, UK.
39. Hyland, J. M. E., and Ong, C.-H. L. (1993), Fair games and full completeness for multiplicative linear logic without the MIX-rule, preprint.
40. Hyland, J. M. E., and Ong, C.-H. L. (1995), Pi-calculus, dialogue games and PCF, in "Proc. 7th ACM Conf. Functional Prog. Lang. Comp. Architecture," pp. 96-107, Assoc. Comput. Mach., New York.
41. Jung, A., and Stoughton, A. (1993), Studying the fully abstract model of PCF within its continuous function model, in "Proc. Int. Conf. Typed Lambda Calculi and Applications, Utrecht, March 1993," Lecture Notes in Computer Science, Vol. 664, pp. 230-245, Springer-Verlag, Berlin/New York.
42. Jung, A., and Tiuryn, J. (1993), A new characterization of lambda definability, in "Proc. Int. Conf. Typed Lambda Calculi and Applications, Utrecht, March, 1993," Lecture Notes in Computer Science, Vol. 664, pp. 245-257, Springer-Verlag, Berlin/New York.
43. Kahn, G., and Plotkin, G. D. (1978), Concrete domains, Theoret. Comput. Sci. 121, 187-278 (Böhm Feschrift Special Issue).
44. [Article first appeared (in French) as Technical Report 338 of INRIA-LABORIA, 1978.]
45. Kelly, G. M. (1982), "Basic Concepts of Enriched Category Theory," London Math. Soc. Lecture Notes Series, Vol. 64, Cambridge Univ. Press, Cambridge, UK.
46. Kleene, S. C. (1959), Recursive functionals and quantifiers of finite types I, Trans. Amer. Math. Soc. 91, 1-52.
47. Kleene, S. C. (1963), Recursive functionals and quantifiers of finite types II, Trans. Amer. Math. Soc. 108, 106-142.
48. Kleene, S. C. (1978), Recursive functionals and quantifiers of finite types revisited I, in "General Recursion Theory II, Proceedings of the 1977 Oslo Symposium" (J. E. Fenstad, R. O. Gandy, and G. E. Sacks, Eds.), pp. 185-222, North-Holland, Amsterdam.
49. Kleene, S. C. (1980), Recursive functionals and quantifiers of finite types revisited II, in "The Kleene Symposium" (J. Barwise, H. J. Keisler, and K. Kunen, Eds.), pp. 1-29, North-Holland, Amsterdam.
50. Lambek, J., and Scott, P. J. (1986), "Introduction to Higher Order Categorical Logic," Cambridge Studies in Advanced Mathematics No. 7, Cambridge University Press, Cambridge, UK.
51. Meyer, A. R., and Cosmadakis, S. C. (1988), Semantical paradigms: notes for an invited lecture, in "Proc. 3rd Annual IEEE Symp. Logic in Computer Science," Computer Society Press, New York.
52. Milner, R. (1975), Processes, a mathematical model of computing agents, in "Logic Colloquium, Bristol 1973," pp. 157-174, North-Holland, Amsterdam.
53. Milner, R. (1977), Fully abstract models of typed lambda-calculus, Theoret. Comp. Sci. 4, 1-22.
54. Milner, R. (1991), "Polyadic π-Calculus: A Tutorial," Technical Report ECS-LFCS-91-180, LFCS, University of Edinburgh.
55. [Also in "Logic and Algebra of Specification," (F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds.), Springer-Verlag, Berlin/New York, 1993.]
56. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I and II, Inform. and Comput. 100, 1-77.
57. Morris, J. H. (1968), "Lambda Calculus Models of Programming Languages," Ph.D. thesis, M.I.T., Cambridge, MA.
58. Nickau, H. (1994), Hereditarily sequential functionals, in "Proceedings of the Symposium of Logical Foundations of Computer Science," Lecture Notes in Computer Science, Springer-Verlag, Berlin/ New York.
59. Ong, C.-H. L. (1995), Correspondence between operational and denotational semantics, in "Handbook of Logic in Computer Science" (S. Abramsky, D. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 4, pp. 269-356, Oxford University Press, Oxford.
60. Ong, C.-H. L., and Ritter, E. (1994), A generic strong normalization proof: application to the calculus of constructions (extended abstract), in "Computer Science Logic: 7th Workshop, CSL'93, Swansea, UK, Sep. 1993, Selected Papers," Lecture Notes in Computer Science, Vol. 832, pp. 261-279, Springer-Verlag, Berlin/New York.
61. Platek, R. A. (1966), "Foundations of Recursion Theory," Ph.D. thesis, Stanford University.
62. Plotkin, G. D. (1975), Call-by-name, call-by-value and the lambda calculus, Theoret. Comput. Sci. 1, 125-159.
63. Plotkin, G. D. (1977), LCF as a programming language, Theoret. Comput. Sci. 5, 223-255.
64. Plotkin, G. D., and Winskel, G. (1994), Bistructures, bidomains and linear logic, in "Proceedings of International Colloquium on Automata, Programming and Languages 1994."
65. Reynolds, J. C. (1983), Types, abstraction and parametric polymorphism, in "Information Processing 1983," pp. 513-523.
66. Rogers, H. (1967), "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York.
67. Sazonov, V. Yu. (1975), Sequentiality and parallely computable functionals, in "Proc. Symp. Lambda Calculus and Computer Science Theory," Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, Berlin/New York.
68. Sazonov, V. Yu., Degress of parallelism in computations, in "Proc. Symp. Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 45, Springer-Verlag, Berlin/ New York.
69. Sazonov, V. Yu. (1976), Expressibility of functions in Scott's LCF language, Algebra i Logika 15, 308-330. [Translated from Russian]
70. Sazonov, V. Yu. (1976), Functional computable in series and in parallel (english translation), Mat. Zhurnal 17, 648-672.
71. Scott, D. S. (1993), A type-theoretical alternative to CUCH, ISWIM and OWHY, Theoret. Comp. Sci. 121, 411-440.
72. Sieber, K. (1992), Reasoning about sequential functions via logical relations, in "Applications of Categories in Computer Science" (M. P. Fourman et al., Ed.), pp. 66-94, Cambridge University Press, Cambridge, UK.
73. Spector, C. (1962), Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, in "Recursive Function Theory, Proc. Symposia in Pure Mathematics V," pp. 1-27, Amer. Math. Soc., Providence, RI.
74. Stoughton, A. (1988), "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer Science, Pitman, London.
75. Strachey, C. (1967), "Fundamental Concepts in Programming Languages," Lecture Notes for the International Summer School in Computer Programming, Copenhagen.
76. Tait, W. W. (1967), Intensional interpretation of functional of finite type i, J. Symbolic Logic 32, 198-212.
77. Tarski, A. (1955), A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5, 285-309.
78. van Draanen, J.-P. (1995), "Models for Simply Typed Lambda-Calculi with Fixed Point Combinators and Enumerators," Ph.D. thesis, Catholic University of Nijmegen.
79. ∞-models of the lambda calculus, SIAM J. Comput. 5, 488-521.
80. Wadsworth, C. P. (1978), Approximate reduction and lambda calculus models, SIAM J. Comput. 7, 337-356.
81. Winskel, G. (1980), "Events in Computation," Ph.D. thesis, University of Edinburgh.
82. Winskel, G. (1987), Event structures, in "Petri Nets: Application and Relationships to Other Models of Concurrency" (W. Brauer, W. Reisig, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 255, pp. 325-392, Springer-Verlag, Berlin/New York.
83. Winskel, G. (1994), Stable bistructure models of PCF, preprint.