Compilation and equivalence of imperative objects

Journal of Functional Programming

Volumn 9, Issue 4, 1999, Pages 373-426

  Gordon, Andrew D ^a,c   Hankin, Paul D ^a   Lassen, Søren B ^b,d,e  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b AARHUS UNIVERSITY   (Denmark)

^c MICROSOFT RESEARCH   (United States)

^d UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^e DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033462273     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003482     Document Type: Article

References (52)

1. Abadi, M. and Cardelli, L. (1995a) An imperative object calculus. Proceedings TAPSOFT'95: Lecture Notes in Computer Science 915, pp. 471-485. Springer-Verlag.
2. Abadi, M. and Cardelli, L. (1995b) An imperative object calculus: Basic typing and soundness. Proceedings SIPL'95. Technical Report UIUCDCS-R-95-1900, Department of Computer Science, University of Illinois at Urbana-Champaign.
3. Abadi, M. and Cardelli, L. (1996) A Theory of Objects. Springer-Verlag.
4. Abelson, H. and Sussman, G. J. (1985) Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Mass.
5. Agha, G., Mason, I., Smith, S. and Talcott, C. (1997) A foundation for actor computation. J. Functional Programming, 7(1), 1-72.
6. Cardelli, L. (1995) A language with distributed scope. Computing systems, 8(1), 27-59.
7. Chambers, C. (1992) The design and implementation of the self compiler, an optimizing compiler for object-oriented programming languages. PhD thesis, Computer Science Department, Stanford University.
8. di Blasio, P., Fisher, K. and Talcott, C. (1997) Analysis for concurrent objects. In: Bowman, H. and Derrick, J. (eds.), Proceedings FMOODS'97. Chapman & Hall.
9. Felleisen, M. and Friedman, D. (1986) Control operators, the SECD-machine, and the γ-calculus. Formal Description of Programming Concepts III, pp. 193-217. North-Holland.
10. Felleisen, M. and Friedman, D. (1989) A syntactic theory of sequential state. Theoretical Comput. Sci. 69, 243-287.
11. Gordon, A. D. (1994) Functional Programming and Input/Output. Cambridge University Press.
12. Gordon, A. D. (1998) Operational equivalences for untyped and polymorphic object calculi. In: Gordon, A. D. and Pitts, A. M. (eds.), Higher Order Operational Techniques in Semantics. Cambridge University Press.
13. Gordon, A. D. and Hankin, P. D. (1998) A concurrent object calculus: Reduction and typing. Proceedings HLCL'98. Elsevier.
14. Gordon, A. D. and Pitts, A. M. (eds). (1998) Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press.
15. Gordon, A. D. and Rees, G. D. (1996) Bisimilarity for a first-order calculus of objects with subtyping. Proceedings POPL'96, pp. 386-395. ACM.
16. Gordon, A. D., Lassen, S. B. and Hankin, P. D. (1998) Compilation and equivalence of imperative objects (revised report). BRICS Report RS-98-55, BRICS, Department of Computer Science, University of Aarhus. A shorter version was presented at Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 1997. Lecture Notes of Computer Science 1346, pp. 74-87. Springer-Verlag.
17. Gordon, A. D., Lassen, S. B. and Hankin, P. D. (1998) Compilation and equivalence of imperative objects (revised report). BRICS Report RS-98-55, BRICS, Department of Computer Science, University of Aarhus. A shorter version was presented at Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 1997. Lecture Notes of Computer Science 1346, pp. 74-87. Springer-Verlag.
18. Guttman, J. D., Swarup, V. and Ramsdell, J. (1995) The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1/2), 33-110.
19. Hannan, J. and Miller, D. (1992) From operational semantics to abstract machines. Mathematical Structures in Computer Science, 4(2), 415-489.
20. Hardin, T., Maranget, L. and Pagano, B. (1998) Functional runtime systems within the lambda-sigma calculus. J. Functional Programming, 8(2), 131-176.
21. Honsell, F., Mason, I., Smith, S. and Talcott, C. (1993) A variable typed logic of effects. Information & Computation, 119(1), 55-90.
22. Howe, D. J. (1996) Proving congruence of bisimulation in functional programming languages. Information & Computation, 124(2), 103-112.
23. Jones, C. B. (1996) Accommodating interference in the formal design of concurrent object-based programs. Formal Methods in System Design, 8(2), 105-122.
24. Kahn, G. (1987) Natural semantics. Proceedings STACS'87: Lecture Notes in Computer Science 247, pp. 22-39. Springer-Verlag.
25. Kleist, J. and Sangiorgi, D. (1998) Imperative objects and mobile processes. Proceedings PROCOMET'98.
26. Landin, P. J. (1964) The mechanical evaluation of expressions. Computer J. 6, 308-320.
27. Leroy, X. (1990) The ZINC experiment: an economical implementation of the ML language. Technical Report 117, INRIA, Rocquencourt, France.
28. Martin-Löf, P. (1983) Notes on the domain interpretation of type theory. Proceedings of the Workshop on Semantics of Programming Languages, Chalmers, Sweden.
29. Mason, I. and Talcott, C. (1991) Equivalence in functional languages with effects. J. Functional Programming, 1(3), 287-327.
30. Mason, I. and Talcott, C. (1992) References, local variables and operational reasoning. Proceedings LICS'92.
31. Mason, I. and Talcott, C. (1995) Reasoning about object systems in VTLoE. Int. J. Foundations of Comput. Sci. 6(3), 265-298.
32. Meyer, A. and Cosmadakis, S. (1988) Semantical paradigms: Notes for an invited lecture. Proceedings LICS'88, pp. 236-253.
33. Meyer, A. and Sieber, K. (1988) Towards fully abstract semantics for local variables. Proceedings POPL'88, pp. 236-253.
34. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. MIT Press.
35. Moggi, E. (1989) Notions of computations and monads. Information & Computation, 93, 55-92.
36. Morris, J. H. (1968) Lambda-calculus models of programming languages. PhD thesis, MIT.
37. Nielson, F. and Nielson, H. R. (1998) The flow logic of imperative objects. Proceedings MFCS'98: Lecture Notes in Computer Science. Springer-Verlag.
38. Nordström, B., Petersson, K. and Smith, J. M. (1990) Programming in Martin-Löf's type theory. The International Series of Monographs in Computer Science, vol. 7. Clarendon Press.
39. Ohori, A. (1992) A compilation method for ML-style polymorphic record calculi. Proceedings POPL'92, pp. 154-165. ACM.
40. Pitts, A. M. and Stark, I. D. B. (1998) Operational reasoning for functions with local state. In: Gordon, A. D. and Pitts, A. M. (eds.), Higher Order Operational Techniques in Semantics. Cambridge University Press.
41. Plotkin, G. D. (1975) Call-by-name, call-by-value and the lambda calculus. Theoretical Comput. Sci. 1, 125-159.
42. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Comput. Sci., 5, 223-255.
43. Plotkin, G. D. (1981) A structural approach to operational semantics. Technical Report FN-19, DAIMI, Aarhus University.
44. Reddy, U. S. (1998) Objects and classes in Algol-like languages. Proceedings FOOL'98.
45. Reynolds, J. C. (1982) Idealized Algol and its specification logic. In: Néel, D. (ed.), Tools and Notions for Program Construction, pp. 121-161. Cambridge University Press.
46. Rittri, M. (1990) Proving compiler correctness by bisimulation. PhD thesis, Chalmers.
47. Sangiorgi, D. (1997) Typed π-calculus at work: a proof of Jones' parallelisation transformation on concurrent objects. Proceedings FOOL'97.
48. Sestoft, P. (1997) Deriving a lazy abstract machine. J. Functional Programming, 3(7), 231-264.
49. Stark, I. (1997) Names, equations, relations: Practical ways to reason about new. Proceedings TLCA'97: Lecture Notes in Computer Science 1210, pp. 336-353. Springer-Verlag.
50. Talcott, C. (1998) Reasoning about functions with effects. In: Gordon, A. D. and Pitts, A. M. (eds.), Higher Order Operational Techniques in Semantics. Cambridge University Press.
51. Walker, D. (1995) Objects in the pi-calculus. Information & Computation, 116(2), 253-271.
52. Wand, M. (1995) Compiler correctness for parallel languages. Proceedings FPCA'95, pp. 120-134. ACM.