Full abstraction for Idealized Algol with passive expressions

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 3-42

  Abramsky, Samson ^a   McCusker, Guy ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Algol like languages; Full abstraction; Game semantics

Indexed keywords

EID: 0005486544     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00047-X     Document Type: Article

References (39)

1. S. Abramsky, Axioms for full abstraction and full completeness, in: G. Plotkin, C. Sterling, M. Tofte (Eds.), Essays in Honour of Robin Milner, MIT Press, Cambridge, MA, to appear.
2. S. Abramsky, R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59(2) (1994) 543-574. Also appeared as Technical Report 92/24 of the Department of Computing, Imperial College of Science, Technology and Medicine.
3. S. Abramsky, R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59(2) (1994) 543-574. Also appeared as Technical Report 92/24 of the Department of Computing, Imperial College of Science, Technology and Medicine.
4. S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF, Inform. Comput., 1999, accepted.
5. S. Abramsky, G. McCusker, Games and full abstraction for the lazy λ-calculus, in Proc. 10th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 234-243.
6. S. Abramsky, G. McCusker, Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions (extended abstract), in Proc. 1996 Workshop on Linear Logic, Electronic notes in Theoretical Computer Science, vol. 3, Elsevier, Amsterdam, 1996.
7. S. Abramsky, G. McCusker, Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions, in: P.W. O'Hearn, R.D. Tennent (Eds.), Algol-like Languages, vol 2, Birkhaüser, Basel, 1997, pp. 297-329.
8. G. Bierman, What is a categorical model of intuitionistic linear logic?, in Internat. Conf. on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Springer, Berlin, 1995.
9. F. Borceux, Handbook of Categorical Algebra, vol. 1, Cambridge University Press, Cambridge, 1994.
10. V. Danos, H. Herbelin, L. Regnier, Game semantics and abstract machines, in Proc. 11th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 394-405.
11. M.P. Fiore, E. Moggi, D. Sangiorgi, A fully-abstract model for the π-calculus (extended abstract), in Proc. 11th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 43-54.
12. J.M.E. Hyland, C.-H.L. Ong, On full abstraction for PCF: I, II and III, Inform. Comput., 1999, accepted.
13. IEEE Computer Society Press, Proc. 11th Annual IEEE Symp. on Logic in Computer Science, 1996.
14. G.M. Kelly, Basic Concepts of Enriched Category Theory, Cambridge University Press, Cambridge, 1982.
15. J. Lambek, P.J. Scott, Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, 1986.
16. R. Loader, Finitary PCF is not decidable, Unpublished manuscript, 1996.
17. G. McCusker, Games and full abstraction for FPC, in Proc. 11th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 174-183.
18. G. McCusker, Games and Full Abstraction for a Functional Metalanguage with Recursive Types, Distinguished Dissertations in Computer Science, Springer, Berlin, 1998.
19. R. Milner, Processes, a mathematical model of computing agents, in Logic Colloquium, Bristol 1973, North-Holland, Amsterdam, 1975, pp. 157-174.
20. R. Milner, Fully abstract models of typed lambda-calculi, Theoret. Comput. Sci. 4 (1977) 1-22.
21. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980.
22. R. Milner, Functions as processes, Math. Struct. Comput. Sci. 2(2) (1992) 119-142.
23. H. Nickau, Hereditarily sequential functionals, in Proc. Symp. on Logical Foundations of Computer Science: Logic at St. Petersburg, Lecture notes in Computer Science, Springer, Berlin, 1994.
24. P.W. O'Hearn, Note on Algol and conservatively extending functional programming, J. Funct. Programm. 6(1) (1996) 171-180.
25. P.W. O'Hearn, U. Reddy, Objects, interference and the Yoneda embedding, in: M. Main, S. Brookes, (Eds.), Mathematical Foundations of Programming Semantics: Proc. 11th Internat. Conf, Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers B.V., Amsterdam, 1995.
26. P.W. O'Hearn, R.D. Tennent, Parametricity and local variables, J. ACM 42(3) (1995) 658-709.
27. P.W. O'Hearn, R.D. Tennet (Eds.), Algol-like Languages, Birkaüser, Basel, 1997.
28. F.J. Oles, Type categories, functor categories and block structure, in: M. Nivat, J.C. Reynolds (Eds.), Algebraic Semantics, Cambridge University Press, Cambridge, 1985.
29. A.M. Pitts, Reasoning about local variables with operationally-based logical relations, in Proc. 11th Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 152-163.
30. G. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977) 223-255.
31. U.S. Reddy, Global state considered unnecessary: object-based semantics for interference-free imperative programs, Lisp Symbolic Comput. 9(1) (1996) 7-76.
32. J.C. Reynolds, Syntactic control of interference, in: Conf. Record 5th ACM Symp. on Principles of Programming Languages, 1978, pp. 39-46.
33. J.C. Reynolds, The essence of Algol, in: Proc. 1981 Internat. Symp. on Algorithmic Languages, North-Holland, Amsterdam, 1981, pp. 345-372.
34. R.A.G. Seely, Linear logic, *-autonomous categories and cofree coalgebras, in Category Theory, Computer Science and Logic, American Mathematical Society, Providence, RI, 1987.
35. K. Sieber, Full Abstraction for the Second Order Subset of an ALGOL-like Language, Technischer Bericht A/04/95, FB14, Universität des Saarlandes, 1995.
36. I. Stark, Names and higher-order functions, Ph.D. Thesis, University of Cambridge, December 1994.
37. I. Stark, A fully abstract domain model for the π-calculus, in: Proc. 11th Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 36-42.
38. R.D. Tennent, Denotational semantics, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 3, Oxford University Press, Oxford, 1994, pp. 169-322
39. G. Winskel, The Formal Semantics of Programming Languages, Foundations of Computing, The MIT Press, Cambridge, MA, 1993.