Objects, interference, and the Yoneda embedding

Theoretical Computer Science

Volumn 228, Issue 1-2, 1999, Pages 253-282

  O'Hearn, Peter W ^a   Reddy, Uday S ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Aliasing; Denotational semantics; Interference

Indexed keywords

EID: 0038037635     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00360-0     Document Type: Article

References (40)

1. J. Backus, Can programming be liberated from the von Neumann Style? A functional style and its algebra of programs, Commun. ACM 21 (8) (1978) 613-641.
2. G. Berry, stable models of typed lambda calculi, in: G. Ausiello, C. Boehm (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 62, Springer, Berlin, 1978, pp. 72-89.
3. R. Cartwright, P.-L. Curien, M. Felleisen, Fully abstract semantics for observably sequential Languages, Inform. Comput. 111(2) (1994) 297-401.
4. P.-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, 2nd ed., Birkhauser, Boston, 1993.
5. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
6. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge Univ. Press, Cambridge, 1989.
7. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, Cambridge, MA, 1992.
8. C.A. Gunder, J.C. Mitchell (Eds.), Theoretical Aspects of Objects-Orientation Programming: Types, Semantics, and Language Design, MIT Press, Cambridge, MA, 1994.
9. C.A. Jones, An object-based design method for concurrent programs, Univ of Manchester, CS Tech. Report, UMCS-92-12-1, 1992.
10. G.M. Kelly, Basic Concepts of Enriched Category Theory, London Math. Soc. Lecture Notes Series, vol. 64, Cambridge University Press, Cambridge, 1982.
11. S. Mac Lane, Categories for the working Mathematician, Springer, New York, 1971.
12. A.R. Meyer, K. Sieber, Towards fully abstract semantics for local variables: preliminary report, conf. Record 15th ACM Symp. on Principles of Programming Languages, ACM, New York, 1988, pp. 191-203.
13. R. Milner, Fully abstract models of typed λ-calculi, Theoret. Comput. Sci. 4 (1977) 1-22.
14. J.C. Mitchell, Type systems for programming languages, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam, 1990, pp. 365-458.
15. E. Moggi, Computational lambda-calculus and monads, Proc. 4th Annual Symp. on Logic in Computer Science, Pacific Grove, California, IEEE Computer society Press, Silverspring MD, 1989, pp. 14-23.
16. M. Odersky, A functional theory of local names, Conf. Record 20th ACM Symp. on Principles of Programming Languages, Charleston, South Carolina, ACM, New York, 1993.
17. P.W. O'Hearn, A model for syntatic control of interference, Math. Struct. Comput. Sci. 3 (1993) 435-465.
18. P.W. O'Hearn, A.J. Power, M. Takeyama, R.D. Tennent, Syntactic control of interference revisited, in this volume, 1995.
19. P.W. O'Hearn, R.D. Tennent, Semantical analysis of specification logic, part 2, Inform. Comput. 107 (1) (1993) 25-57.
20. P.W. O'Hearn, R.D. Tennent, Parametricity and local variables, J. ACM 42 (3) (1995) 658-709.
21. F.J. Oles, A category-theoretic approach to the semantics of programming languages, Ph.D. Thesis, Syracuse University, Syracuse, NY, 1982.
22. F.J. Oles, Type algebras, functor categories and block structure, in: M. Nivat, J.C. Reynolds (Eds.), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, England, 1985, pp. 543-573.
23. A. Pitts, I. Stark, On the observable properties of higher-order functions that dynamically create local names (preliminary report), ACM SIGLPLAN Workshop on State in Programming Languages, 1993, pp. 31-45. Available as Yale Technical Report YALEU/DCS/RR-968.
24. A.M. Pitts, I. Stark, Observable properties of higher order functions that dynamically create local names, or: What's new? Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, pp. 122-141.
25. G.D. Plotkin, The category of complete partial orders: a tool for making meanings, Lecture notes for the Summer School on Foundations of Artificial Intelligence and Computer Science, Pisa, June 1978.
26. G.D. Plotkin, Type theory and recursion, Proc. Symp. on Logic in Computer Science, Montreal, IEEE Computer Society Press, Silverspring, MD, 1993.
27. U.S. Reddy, Passivity and independence, 9th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 342-352.
28. U.S. Reddy, Global states considered unnecessary: introduction to object-based semant ics, Lisp Symbolic Comput. (1996). Special issue on State in Programming Languages.
29. J.C. Reynolds, Syntatic control of interference, Conf. Record 5th ACM Symp. on Principles of Programming Languages, Tucson, Arizona, ACM, New York, 1978, pp. 39-46.
30. J.C. Reynolds, The essence of Algol, in: J.W. de Bakker, J.C. van Vliet (Eds.), Algorithmic Languages, North-Holland, Amsterdam, 1981, pp. 345-372.
31. J.C. Reynolds, Types, abstraction and parametric polymorphism, in: R.E.A. Mason (Ed.), Information Processing 83, North-Holland, Amsterdam, 1983, pp. 513-523.
32. R.A.G. Seely, Linear logic, *-autonomous categories and cofree coalgebras, in: J.W. Gray, A. Scedrov (Eds.), Categories in Computer Science and Logic, Contemp. Math., vol. 92, AMS, Providence, RI, 1989, pp. 371-382.
33. K. Sieber, Full abstraction for the second order subset of an Algol-like language (preliminary report), Technischer Bericht A 01/94, Universitaet des Saarlandes, February, 1994.
34. I.A. Stark, Categorical models of local names, Lisp Symbolic Comput. 9 (1) (1996) 77-107.
35. C. Strachey, Fundamental Concepts in Programming Languages, Unpublished lecture notes, International Summer School in Computer Programming, Copenhagen, August 1967.
36. R.D. Tennent, Functor-category semantics of programming languages and logics, in: D. Pitt, S. Abramsky, A. Poigné, D. Rydeheard (Eds.), Category Theory and Computer Programming, Lecture Notes in Computer Science, vol. 240, Guildford, UK, Springer, Berlin, 1986, pp. 206-224.
37. R.D. Tennent, Semantical analysis of specification logic, Inform. Comput. 85 (2) (1990) 135-162.
38. R.D. Tennent, Semantics of Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1991.
39. D. Walker, Objects in the π-calculus, Inform. Comput. 116 (2) (1995) 253-271.
40. G. Winskel, Event structures, in: W. Brauer, W. Reisig, G. Rozenberg (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science, vol. 255, Springer, Berlin, 1987, pp. 325-292.