Kripke logical relations and PCF

Information and Computation

Volumn 120, Issue 1, 1995, Pages 107-116

  Ohearn, Peter W ^a   Riecke, Jon G ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000897440     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1103     Document Type: Article

References (33)

1. Abramsky, S., Jagadeesan, R., and Malacaria, P. (1993), Games and full abstraction for PCF: Preliminary announcement, communicated to the TYPES electronic mail list, July 23, 1993.
2. Abramsky, S., Jagadesan, R., and Malacaria, P. (1994). Full abstraction for PCF (extended abstract), in "Theoretical Aspects of Computer Software" (M. Hagiya and J. C. Mitchell, Eds.), pp. 1-15, Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin/New York.
3. Berry, G. (1978), Stable models of typed lambda calculi, in "Automata. Languages and Programming" (G. Ausiello and C. Bohm, Eds.), pp. 72-89, Lecture Notes in Computer Science, Vol. 62, Springer-Verlag, Berlin/New York.
4. Berry, G., and Curien, P.-L. (1982), Sequential algorithms on concrete data structures, Theoret. Comput. Sci. 20, 265-321.
5. Berry, G., Curien, P.-L., and Levy, J.-J. (1985), Full abstraction for sequential languages: The state of the art, in "Algebraic Methods in Semantics" (M. Nivat and J. C. Reynolds, Eds.), pp. 89-132, Cambridge Univ. Press, Cambridge, UK.
6. Brookes, S., and Geva, S. (1994), Sequential functions on indexed domains and full abstraction for a sublanguage of PCE, in "Proceedings of the 8th Annual Symposium on Mathematical Foundations of Program Semantics, New Orleans" (S. Brookes el al, Eds.), pp. 320-332, Lecture Notes in Computer Science, Vol. 802, Springer-Verlag, Berlin/New York.
7. Bucciarelli, A., and Ehrhard, T. (1991), Sequentiality and strong stability, in "Proceedings, 6th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA," IEEE Computer Society Press, Los Alamitos, CA.
8. Cartwright, R., Curien, P.-L., and Felleisen, M. (1994), Fully abstract semantics for observably sequential languages. Inform, and Comput. 3, 297-401.
9. Curien, P.-L. (1986), "Categorical Combinators, Sequential Algorithms and Functional Programming," Wiley, New York.
10. Gallier, J. H. (1989), On Girard's "candidats de reductibility," in "Logic and Computer Science" (P. Odifreddi, Ed.), Academic Press, San Diego.
11. Girard, J.-Y., Lafont, Y., and Taylor, P. (1989), "Proofs and Types," Cambridge Univ. Press, Cambridge, UK.
12. Hyland, J., and Ong, L. (1993), Dialogue games and innocent strategies: An approach to (intensional) full abstraction for PCF (preliminary announcement), communicated to the TYPES electronic mail list, July 26, 1993.
13. Jung, A., and Stoughton, A. (1993), Studying the fully abstract model of PCF within its continuous function model, in "Typed Lambda Calculi and Applications," pp. 230-244, Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York.
14. Jung, A., and Tiuryn, J. (1993), A new characterization of lambda definability, in "Typed Lambda Calculi and Applications," pp. 245-257, Lecture Notes in Computer Science, Vol. 664, Springer-Verlag, Berlin/New York.
15. Loader, R. (1994), The undecidability of λ-definability, in "The Church Festschrift" (M. Zeleny, Ed.), CSLI/Univ. of Chicago Press, Chicago.
16. Ma, C., and Reynolds, J. C. (1992), Types, abstraction, and parametric polymorphism, part 2, in "Proceedings of the 1991 Conference on the Mathematical Foundations of Programming Semantics" (S. Brookes et al., Eds.), pp. 1-10, Lecture Notes in Computer Science, Vol. 598, Springer-Verlag, Berlin/New York.
17. Meyer, A. R., and Cosmadakis, S. S. (1988), Semantical paradigms: Notes for an invited lecture, in "Proceedings, 3rd Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, pp. 236-253, IEEE Computer Society Press, Los Alamitos, CA.
18. Milner, R. (1977), Fully abstract models of typed A-calculi, Theoret. Comput. Sci. 4, 1-22.
19. Mitchell, J. C. (1990), Type systems for programming languages, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, Chap. 8, pp. 365-458, Elsevier, Amsterdam/The MIT Press, Cambridge, MA.
20. Mitchell, J. C., and Scedrov, A. (1993), Notes on sconing and relators, in "Computer Science Logic '92, Selected Papers" (E. Boerger et al., Eds.), pp. 352-378, Lecture Notes in Computer Science, Vol. 702, Springer-Verlag, Berlin/New York.
21. Odifreddi, P. (1989), "Classical Recursion Theory," Studies in Logic and Foundations of Mathematics, Vol. 125, North-Holland, Amsterdam.
22. O'Hearn, P., and Riecke, J. (1994), Fully abstract translations and parametric polymorphism, in "Programming Languages and Systems-ESOP '94" (D. Sannella, Ed.), pp. 454-468, Lecture Notes in Computer Science, Vol. 788, Springer-Verlag, Berlin/New York.
23. O'Hearn, P. W., and Tennent, R. D. (1993), "Parametricity and Local Variables," Technical Report SU-CIS-93-30, Syracuse University; preliminary version appeared in "Conference Record, 20th ACM Symposium on Principles of Programming Languages, Charleston, South Carolina," pp. 171-184, ACM, New York.
24. Plotkin, G. D. (1973), "Lambda-Definability and Logical Relations." Memorandum SAI-RM-4, School of Artificial Intelligence, University of Edinburgh.
25. Plotkin, G. D. (1977), LCF considered as a programming language, Theoret. Comput. Sci. 5, 223-255.
26. Plotkin, G. D. (1980), Lambda-definability in the full type hierarchy, in "To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism" (J. P. Seldin and J. R. Hindley, Eds.), pp. 363-373, Academic Press, New York.
27. Reynolds, J. C. (1983), Types, abstraction and parametric polymorphism, in "Information Processing 83" (R. E. A. Mason, Ed.), pp. 513-523, North-Holland, Amsterdam.
28. Scott, D. (1993), A type theoretical alternative to CUCH, ISWIM, OWHY, Theor. Comput. Sci. 121, 411-440; published version of unpublished manuscript, Oxford University, 1969.
29. Sieber, K. (1992), Reasoning about sequential functions via logical relations, in "Applications of Categories in Computer Science" (M. P. Fourman, P. T. Johnstone, and A. M. Pitts, Eds.), pp. 258-269, London Mathematical Society Lecture Note Series, Cambridge Univ. Press, Cambridge, UK.
30. Sieber, K. (1993). New steps towards full abstraction for local variables, in "ACM SIGLPLAN Workshop on State in Programming Languages," pp. 88-100; available as Yale Technical Report YALEU/DCS/RR-968.
31. Statman, R. (1985), Logical relations and the typed λ-calculus, Inform, and Comput. 65, 85-97.
32. Stoughton, A. (1988), "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer Science, Pitman, London/Wiley, New York.
33. Stoughton, A. (1994), Mechanizing logical relations, in "Proceedings of the 8th Annual Symposium on Mathematical Foundations of Program Semantics, New Orleans" (S. Brookes el al., Eds.), pp. 359-377, Lecture Notes in Computer Science, Vol. 802, Springer-Verlag, Berlin/New York.