Objects and classes in Algol-like languages

Information and Computation

Volumn 172, Issue 1, 2002, Pages 63-97

  Reddy, Uday S ^a  

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

Author keywords

Algol like languages; Object oriented programming; Relational parametricity; Semantics; Specification logic

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; SEMANTICS;

RELATIONAL PARAMETRICITY;

ALGOL (PROGRAMMING LANGUAGE);

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

References (70)

1. Abadi, M., and Cardelli, L. (1996), An imperative object calculus, Theory Practice Object Systems 1 (3), 151-166.
2. Abadi, M., and Cardelli, L. (1996), "A Theory of Objects," Springer-Verlag, Berlin.
3. Abadi, M., and Leino, R. M. (1997), A logic of object-oriented programs, in "TAPSOFT '97 and CAAP/FASE," Lecture Notes in Computer Science, Vol. 1214, pp. 682-696, Springer-Verlag, Berlin.
4. Abelson, H., Sussman, G. J., and Sussman, J. (1985), "Structure and Interpretation of Computer Programs," MIT Press, Cambridge, MA.
5. Abramsky, S., and McCusker, G. (1997), Linearity, sharing and state, in "Algol-like Languages" (P. W. O'Hearn and R. D. Tennent, Eds.), Vol. 2, Chap. 20, Birkhäuser, Boston.
6. America, P. (1990), Designing an object-oriented programming language with behavioural subtyping, in "Foundations of Object-Oriented Languages" (J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 489, pp. 60-90, Springer-Verlag, Berlin.
7. Andersen, D. S., Pedersen, L. H., Hüttel, H., and Kleist, J. (1997), Objects, types and modal logics, in "FOOL 4," available at http://www.cs.indiana.edu/hyplan/pierce/fool/, electronic proceedings.
8. Bono, V., and Fisher, K. (1998), An imperative, first-order calculus with object extension, in "European Conf. on Object-Oriented Programming."
9. Borba, P., and Goguen, J. (1996), Refinement of concurrent object-oriented programs, in "Formal Methods and Object Technology" (S. Goldsack and S. Kent, Eds.), Chap. 11, Springer-Verlag, Brelin.
10. Brookes, S., Main, M., Melton, A., and Mislove, M. (Eds.) (1995), "Mathematical Foundations of Programming Semantics: Eleventh Annual Conference," Electronic Notes in Theor. Comput. Sci., Vol. 1, Elsevier, Amsterdam.
11. Bruce, K. B. (1995), PolyTOIL: A type-safe polymorphic object-oriented language, in "ECOOP'95," Lecture Notes in Computer Science, Vol. 952, pp. 27-51, Springer-Verlag, Berlin.
12. Bruce, K. C., Cardelli, L., and Pierce, B. C. (1997), Comparing object encodings, in "Theoretical Aspects of Computer Software," Lecture Notes in Computer Science, Vol. 1281, pp. 415-438, Springer-Verlag, Berlin.
13. Cardelli, L. (1984), A semantics of multiple inheritance, in "Semantics of Data Types" (G. Kahn, D. B. MacQueen, and G. Plotkin, Eds.), Lecture Notes in Computer Science, Vol. 173, pp. 51-67, Springer-Verlag, Berlin.
14. Cardelli, L., and Wegner, P. (1986), On understanding types, data abstraction, and polymorphism, Comput. Surv. 17 (4), 471-522.
15. Cook, W. R. (1989), "A Denotational Semantics of Inheritance," Ph.D. thesis, Dep. of Computer Science, Brown Univ. (Tech. Report CS-89-33).
16. Cook, W. R., Hill, W. L., and Canning, P. S. (1990), Inheritance is not subtyping, in "ACM Symp. on Princ. of Program. Lang.," pp. 125-135, Assoc. Comput. Mach., New York; reprinted as Chap. 14 of [25].
17. Dahl, O.-J., and Nygaard, K. (1966), An Algol-based simulation language, Comm. ACM 9 (9), 671-678.
18. DiBlasio, P., and Fisher, K. (1996), A calculus for concurrent objects, in "CONCUR '96," Lecture Notes in Computer Science, Vol. 1119, pp. 655-670, Springer-Verlag, Berlin.
19. Eifrig, J., Smith, S., Trifonov, V., and Zwarico, A. (1995), An interpretation of typed OOP in a language with state, J. Lisp Symbol. Comput. 8 (4), 357-397.
20. Fisher, K., and Mitchell, J. C. (1995), On the relationship between classes, objects and data abstraction, Theory Practice Object-Oriented Systems 4 (1), 3-25.
21. Fisher, K., and Mitchell, J.C. (1996), "Classes = Objects + Data Abstraction," Technical Report STAN-CS-TN-96-31, Stanford University.
22. Gamma, E., Helm, R., Johnson, R., and Vlissides, J. (1995), "Design Patterns," Addison-Wesley, Reading, MA.
23. Ghica, D. R. (1997), "Semantics of Dynamic Variables in Algol-like Languages," Master's thesis, Queen's University, Kingston, Canada, available at ftp://ftp.qucis.queensu.ca/pub/rdt.
24. Girard, J.-Y., Lafont, Y, and Taylor, P. (1989), "Proofs and Types," Cambridge Univ. Press, Cambridge, UK.
25. Gunter, C. A., and Mitchell, J. C. (Eds.) (1994), "Theoretical Aspects of Object-Oriented Programming," MIT Press, Cambridge, MA.
26. He, J. F., Hoare, C. A. R., and Sanders, J. W. (1986), "Data Refinement Refined," Lecture Notes in Computer Science, Vol. 213, pp. 187-196, Springer-Verlag, Berlin.
27. Hoare, C. A. R. (1968), Record handling, in "Programming Languages: NATO Advanced Study Institute" (F. Genuys, Ed.), pp. 291-347, Academic Press, London.
28. Hoare, C. A. R. (1972), Proof of correctness of data representations, Acta Informat. 1, 271-281.
29. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall International, London.
30. Hoffman, M., and Pierce, B. C. (1996), Positive subtyping, Information and Computation 126, 11-33.
31. Kamin, S. (1988), Inheritance in SMALLTALK-80: A denotational definition, in "ACM Symp. on Princ. of Program. Lang."
32. Kamin, S. N., and Reddy, U. S. (1994), Two semantic models of object-oriented languages, in "Theoretical Aspects of Object Oriented Programming" (C. A. Gunter and J. C. Mitchell, Eds.), MIT Press, Cambridge, MA.
33. Kinoshita, Y., O'Hearn, P. W., Power, A. J., Takeyama, M., and Tennent, R. D. (1997), An axiomatic approach to binary logical relations with applications to data refinement, manuscript, Queen Mary and Westfield, London.
34. Lano, K., and Haughton, H. (1992), Reasoning and refinement in object-oriented specification languages, in "ECOOP '97" (O. L. Madsen, Ed.), Lecture Notes in Computer Science, Vol. 615, pp. 78-97, Springer-Verlag, Berlin.
35. Leavens, G. T. (1991), Modular specification and verification of object-oriented programs, IEEE Software, 72-80.
36. Liskov, B., and Wing, J. M. (1994), A behavioral notion of subtyping, ACM Trans. Program. Lang. Syst. 16 (6), 1811-1841.
37. MacLane, S. (1971), "Categories for the Working Mathematician," Springer-Verlag, Berlin.
38. Mason, I. A., and Talcott, C. L. (1989), Axiomatizing operational equivalence in the presence of side effects, in "Proceedings, Fourth Annual Symposium on Logic in Computer Science," pp. 284-293, IEEE Comput. Soc. Press, Los Alamitos, CA.
39. Meyer, A. R., and Sieber, K. (1988), Towards fully abstract semantics for local variables, in "Fifteenth Annual ACM Symposium on Principles of Programming Lang.," pp. 191-203, Assoc. Comput. Mach., New York; reprinted as Chap. 7 of [52].
40. Milner, R. (1971), An algebraic definition of simulation between programs, in "Proc. Second Intern. Joint Conf. on Artificial Intelligence," pp. 481-489, The British Computer Society, London.
41. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, New York.
42. Mitchell, J. C. (1997), "Foundations of Programming Languages" MIT Press, Cambridge, MA.
43. Mitchell, J. C., and Plotkin, G. D. (1988), Abstract types have existential types, ACM Trans. Program. Lang. Syst. 10 (3), 470-502.
44. Morgan, C., and Vickers, T. (Eds.) (1992), "On the Refinement Calculus," Springer-Verlag, Berlin.
45. Odersky, M., Rabin, D., and Hudak, P. (1993), Call by name, assignment and the lambda calculus, in "Twentieth Annual ACM Symposium on Principles of Programming Language," Assoc. Comput. Mach., New York.
46. O'Hearn, P. W. (1993), A model for syntactic control of interference, Math. Struct. Comput. Sci. 3, 435-465.
47. O'Hearn, P. W., Power, A. J., Takeyama, M., and Tennent, R. D. (1995), Syntactic control of interference revisited, in "Mathematical Foundations of Programming Semantics: Eleventh Annual Conference" (S. Brookes, M. Main, A. Melton, and M. Mislove, Eds.), Electronic Notes in Theor. Comput. Sci., Vol. 1, Elsevier, Amsterdam; reprinted as Chap. 18 of [52].
48. O'Hearn, P. W., and Reddy, U. S. (1995), Objects, interference and Yoneda embedding, in "Mathematical Foundations of Programming Semantics: Eleventh Annual Conference" (S. Brookes, M. Main, A. Melton, and M. Mislove, Eds.), Electronic Notes in Theor. Comput. Sci., Vol. 1, Elsevier, Amsterdam.
49. O'Hearn, P. W., and Reynolds, J. C. (1997), From Algol to polymorphic linear lambda-calculus, electronic manuscript, Queen Mary and Westfield, London, available at http://www.qmw.ac.uk/ohearn.
50. O'Hearn, P. W., and Tennent, R. D. (1992), Semantics of local variables, in "Applications of Categories in Computer Science" (M. P. Fourman, P. T. Johnstone, and A. M. Pitts, Eds.), pp. 217-238, Cambridge Univ. Press, Cambridge, UK.
51. O'Hearn, P. W., and Tennent, R. D. (1995), Parametricity and local variables, J. Assoc. Comput. Mach. 42 (3), 658-709; reprinted as Chap. 16 of [52].
52. O'Hearn, P. W., and Tennent, R. D. (Eds.) (1997), "Algol-like Languages (Two Volumes)," Birkhäuser, Boston.
53. Pierce, B., and Turner, D. N. (1993), "Statically Typed Friendly Functions Via Partially Abstract Types," Technical Report ECS-LFCS-93-256, University of Edinburgh.
54. Pierce, B. C., and Turner, D. N. (1994), Simple type-theoretic foundations for object-oriented programming, J. Funct. Programming 4 (2), 207-247.
55. Plotkin, G., and Abadi, M. (1993), A logic for parametric polymorphism, in "Typed Lambda Calculi and Applications-TLCA '93," Lecture Notes in Computer Science, Vol. 664, pp. 361-375, Springer-Verlag, Berlin.
56. Reddy, U. S. (1988), Objects as closures: Abstract semantics of object-oriented languages, in "ACM Symposium on LISP and Functional Programming," pp. 289-297, Assoc. Comput. Mach., New York.
57. Reddy, U. S. (1994), Passivity and independence, in "Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science," pp. 342-352, IEEE Comput. Soc. Press, Los Alamitos, CA.
58. Reddy, U.S. (1996), Global state considered unnecessary: An introduction to object-based semantics,J. Lisp Symbol. Comput. 9, 7-76; reprinted as Chap. 19 of [52].
59. Reynolds, J. C. (1978), Syntactic control of interference, in "ACM Symposium on Principles of Programming Languages," pp. 39-46, Assoc. Comput. Mach., New York; reprinted as Chap. 10 of [52].
60. Reynolds, J. C. (1981), The essence of Algol, in "Algorithmic Languages" (J. W. de Bakker and J. C. van Vliet, Eds.), pp. 345-372, North-Holland, Amsterdam; reprinted as Chap. 3 of [52].
61. Reynolds, J. C. (1982), Idealized Algol and its specification logic, in "Tools and Notions for Program Construction" (D. Neel, Ed.), pp. 121-161, Cambridge Univ. Press, Cambridge, UK, reprinted as Chap. 6 of [52].
62. Reynolds, J. C. (1983), Types, abstraction and parametric polymorphism, in "Information Processing '83" (R. E. A. Mason, Ed.), pp. 513-523, North-Holland, Amsterdam.
63. Schoett, O. (1990), Behavioral correctness of data representations, Sci. Comput. Program. 14, 43-57.
64. Stark, I. (1996), Categorical models for local names, Lisp Symbol. Comput. 9 (1), 77-107.
65. Swarup, V., Reddy, U. S., and Ireland, E. (1997), Assignments for applicative languages, in "Algol-like Languages" (P. W. O'Hearn and R. D. Tennent, Eds.), Chap. 9, pp. 235-272, Birkhäuser, Boston.
66. Tennent, R. D. (1990), Semantical analysis of specification logic, Inform and Comput. 85 (2), 135-162; reprinted as Chap. 13 of [52].
67. Tennent, R. D. (1994), Denotational semantics, in "Handbook of Logic in Computer Science" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 3, pp. 169-322, Oxford Univ. Press, London.
68. Winskel, G. (1987), Event structures, in "Petri Nets: Applications 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.
69. Winskel, G. (1989), An introduction to event structures, in "Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency" (J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 354, pp. 364-397, Springer-Verlag, Berlin.
70. Dunphy, B. P. (2001), Uniform families, Ph.D. thesis (to appear), Department of Mathematics, University of Illinois at Urbana-Champaign.