Simple Type-Theoretic Foundations for Object-Oriented Programming

Journal of Functional Programming

Volumn 4, Issue 2, 1994, Pages 207-247

  Pierce, Benjamin C ^a   Turner, David N ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972274325     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800001040     Document Type: Article

References (52)

1. Abadi, M. (1993) Baby Modula-3 and a Theory of Objects, Research Report 95, Digital Equipment Corporation, Systems Research Center, Palo Alto, CA.
2. Bobrow, D.G., DeMichiel, L.G., Gabriel, R.P., Keene, S.E., Kiczales, G. and Moon, D.A. (1988) Common Lisp Object System Specification X3J13 Document 88-002R, SIGPLAN Not. 23.
3. Bruce, K. and Mitchell, J. (1992) PER models of subtyping, recursive types and higher-order polymorphism. In: Proc. 19th ACM Symp. on Principles of Program. Lang., January.
4. Bruce, K.B. (1991) The equivalence of two semantic definitions for inheritance in object-oriented languages. In: Proc. Math. Foundations of Program. Semantics, March.
5. Bruce, K.B. (1992) A Paradigmatic Object-Oriented Language: Design, Static Typing and Semantics, Technical Report CS-92-01, Williams College, January.
6. Bruce, K.B. (1993) Safe type checking in a statically typed object-oriented programming language. In: Proc. 20th ACM Symp. on Principles of Program. Lang., January.
7. Bruce, K.B. and Longo, G. (1990) A modest model of records, inheritance, and bounded quantification, Information and Computation 87: 196–240. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993. An earlier version appeared in Proc. IEEE Symp. on Logic in Comput. Sci., 1988.)
8. Bruce, K.B. and van Gent, R. (1993) TOIL: A new Type-safe Object-oriented Imperative Language, submitted for publication.
9. Budd, T. (1991) An Introduction to Object-Oriented Programming, Addison-Wesley, Reading, MA.
10. Canning, P., Cook, W., Hill, W., Olthoff, W. and Mitchell, J. (1989) F-bounded quantification for object-oriented programming. In: Proc. 4th Intern. Conf. on Functional Program. Lang. & Computer Archit., pp. 273–280, September.
11. Cardelli, L. (1986) Amber, I.: Cousineau, G., Curien, P.-L. and Robinet, B. (Eds.), Combinators and Functional Programming Languages, Lecture Notes in Computer Science 242, Springer, pp. 21–47.
12. Cardelli, L. (1988a) A semantics of multiple inheritance, Information and Computation 76: 138–164. (Preliminary version in Kahn, MacQueen and Plotkin, eds., Semantics of Data Types, Lecture Notes in Computer Science 173, Springer, 1984.)
13. Cardelli, L. (1988b) Structural subtyping and the notion of power type. In: Proc. 15th ACM Symp. on Principles of Program. Lang., pp. 70–79, January.
14. Cardelli, L. (1990) Notes about F%, Unpublished notes, October.
15. Cardelli, L. (1992a) Extensible Records in a Pure Calculus of Subtyping, Research report 81, DEC Systems Research Center, January. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
16. Cardelli, L. (1992b) Typed Foundations of Object-oriented Programming, Tutorial given at POPL ’92, January.
17. Cardelli, L. and Mitchell, J. (1991) Operations on records, Mathematical Structures in Computer Science 1: 3–48. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993. Available as DEC Systems Research Center Research Report #48, August 1989, and in Proceedings MFPS ’89, Lecture Notes in Computer Science 442, Springer.)
18. Cardelli, L. and Wegner, P. (1985) On understanding types, data abstraction, and polymorphism, Comput. Surv. 17(4).
19. Cardelli, L., Martini, S., Mitchell, J.C. and Scedrov, A. (1991) An extension of system F with subtyping. In: Ito, T. and Meyer, A.R. (Eds.), Theoretical Aspects of Computer Software (Sendai, Japan), Lecture Notes in Computer Science 526, Springerg, pp. 750–770.
20. Castagna, G., Ghelli, G. and Longo, G. (1992) A calculus for overloaded functions with subtyping. In: ACM Conf. on LISP and Functional Progra.g, ACM Press, San Francisco, CA, pp. 182–192. (Also available as Rapport de Recherche LIENS-92-4, Ecole Normale Superieure, Paris, France.)
21. Castagna, G. (1992) Strong Typing in Object-Oriented Paradigms, Rapport de Recherche LIENS-92-11, Ecole Normale Superieure, Paris, France, May.
22. Compagnoni, A.B. and Pierce, B.C. (1993) Multiple Inheritance via Intersection Types, Technical Report ECS-LFCS-93-275, LFCS, University of Edinburgh, UK, August. (Also available as Catholic University Nijmegen Computer Science Technical Report 93–18. Submitted for conference publication.)
23. Cook, W. (1989) A Denotational Semantics of Inheritance, PhD thesis, Brown University.
24. Cook, W.R., Hill, W.L. and Canning, P.S. (1990) Inheritance is not subtyping. In: Proc. 17th Ann. ACM Symp. on Principles of Program. Lang., pp.125–135, January. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
25. Coppo, M., Dezani-Ciancaglini, M. and Venneri, B. (1981) Functional characters of solvable terms, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 27: 45–58.
26. Curien, P.-L. and Ghelli, G. (1992) Coherence of subsumption: Minimum typing and type-checking in F, Mathematical Struct, in Comput. Sci. 2: 55–91. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
27. de Bruijn, N.G. (1972) Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem, Indag. Math. 34(5): 381–392.
28. Ghelli, G. (1991) A static type system for message passing. In: Conf.on Object-Oriented Program. Syst., Lang. & Applic., pp. 129–143, October. (Distributed as SIGPLAN Not. 26(11), 1991.)
29. Girard, J.-Y. (1972) Interpretation fonctionelle et elimination des coupures de Varithmetique d'ordre superieur. PhD thesis, Universite Paris VII, France.
30. Goldberg, A. and Robson, D. (1983) Smalltalk-80: The Language and Its Implementation, Addison-Wesley, Reading, MA.
31. Graver, J.O. and Johnson, R.E. (1990) A type system for Smalltalk. In: Proc. 17th Ann. ACM Symp. on Principles of Program. Lang., pp. 125–135, January.
32. Hofmann, M. and Pierce, B. (1994) A unifying type-theoretic framework for objects. In: Symp. on Theoretical Aspects of Comput. Sci. (Extended version available as An Abstract View of Objects and Subtyping (Preliminary Report)’, University of Edinburgh, LFCS Technical Report ECS-LFCS-92-226, 1992.)
33. Jategaonkar, L.A. and Mitchell, J.C. (1988) ML with extended pattern matching and subtypes (preliminary version). In: Proc. ACM Conf. on Lisp and Functional Program., pp. 198–211, July.
34. Kamin, S. (1988) Inheritance in Smalltalk-80: A denotational definition. In: Proc. ACM Symp. on Principles of Program. Lang. pp. 80–87, January.
35. Mitchell, J. and Plotkin, G. (1988) Abstract types have existential type, ACM Trans. Program. Lang. & Syst. 10(3).
36. Mitchell, J., Meldal, S. and Madhav, N. (1991) An extension of Standard ML modules with subtyping and inheritance. In: Proc. 18th ACM Symp. on Principles of Program. Lang., pp. 270–278, January.
37. Mitchell, J.C. (1990) Toward a typed foundation for method specialization and inheritance. In: Proc. 17th ACM Symp. on Principles of Program. Lang. pp. 109–124, January. (Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
38. Mitchell, J.C., Honsell, F. and Fisher, K. (1993) A lambda calculus of objects and method specialization. In: IEEE Symp. on Logic in Comput. Sci., pp. 109–124, June.
39. Pierce, B.C. and Turner, D.N. (1993a) Object-oriented programming without recursive types. In: Proc. 20th ACM Symp. on Principles of Program. Lang., pp. 109–124, January.
40. Pierce, B.C. and Turner, D.N. (1993b) Statically Typed Friendly Functions via Partially Abstract Types, Technical Report ECS-LFCS-93-256. University of Edinburgh, LFCS, pp. 109–124.(Also available as INRIA-Rocquencourt Rapport de Recherche No. 1899.)
41. Reddy, U.S. (1988) Objects as closures: Abstract semantics of object oriented languages. In: Proc. ACM Symp. on Lisp and Functional Program., pp. 289–297, July.
42. Remy, D. (1989) Typechecking records and variants in a natural extension of ML. In: Proc. 16th Ann. ACM Symp. on Principles of Program. Lang., pp. 242–249. (Also in C.A.
43. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
44. Reynolds, J.C. (1983) Types, abstraction, and parametric polymorphism. In: Mason, R.E.A. (Ed.), Information Processing 83, Elsevier, Amsterdam, pp. 513–523.
45. Reynolds, J. (1985) Three approaches to type structure. In: Mathematical Foundations of Software Development; Lecture Notes in Computer Science 185, Springer.
46. Reynolds, J.C. (1978) User defined types and procedural data structures as complementary approaches to data abstraction. In: Gries, D. (Ed.), Programming Methodology, A Collection of Articles by IFIP WG2.3, Springer, New York, pp. 309–317. (Reprinted from S.A. Schu-man, ed., New Advances in Algorithmic Languages 1975, Inst, de Recherche d’lnformatique et d’Automatique, Rocquencourt, pp. 157–168. Also in C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1993.)
47. Robinson, E. and Tennent, R. (P) Bounded quantification and record-update problems. Message to Types electronic mail list.
48. Snyder, A. (1986) Encapsulation and inheritance in object-oriented programming languages. In: Proc. OOPSLA ’86. Distributed as ACM SIGPLAN Not. 21(11): 38–45.
49. Ungar, D. and Smith, R.B. (1987) Self: The power of simplicity. In: Proc. ACM Symp. on Object-Oriented Program.: Lang., Syst. and Applic., pp. 227–241.
50. Wand, M. (1987) Complete type inference for simple objects. In: Proc. IEEE Symp. on Logic in Comput. Sci., pp. 227–241, June.
51. Wand, M. (1988) Corrigendum: Complete type inference for simple objects. In: Proc. IEEE Symp. on Logic in Comput. Sci.
52. Wand, M. (1989) Type Inference for record concatenation and multiple inheritance. In: Proc. 4th Ann. IEEE Symp. on Logic in Comput. Sci., pp. 92–97.