Positive Subtyping

Information and Computation

Volumn 126, Issue 1, 1996, Pages 11-33

  Hofmann, Martin ^a   Pierce, Benjamin C ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (49)

1. Abadi, Martín, and Cardelli, Luca (1994), A theory of primitive objects: Untyped and first-order systems, in "Theoretical Aspects of Computer Software (TACS), Sendai, Japan."
2. Abadi, M., and Plotkin, G. D. (1990), A PER model of polymorphism and recursive types, in "Proc. IEEE Symp. on Logic in Computer Science," pp. 355-365.
3. Amadio, Roberto M. (1991), Recursion over realizability structures, Inform. and Comput. 90(2), 55-85.
4. Breazu-Tannen, Val, Coquand, Thierry, Gunter, Carl, and Scedrov, Andre (1991), Inheritance as implicit coercion, Inform. and Comput. 93, 172-221. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA.
5. Breazu-Tannen, Val, Coquand, Thierry, Gunter, Carl, and Scedrov, Andre (1991), Inheritance as implicit coercion, Inform. and Comput. 93, 172-221. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA.
6. Bruce, Kim B., and Longo, Giuseppe (1990), A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87, 196-240. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994. An earlier version appeared in "Proceedings of the IEEE Symposium on Logic in Computer Science, 1988."
7. Bruce, Kim B., and Longo, Giuseppe (1990), A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87, 196-240. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994. An earlier version appeared in "Proceedings of the IEEE Symposium on Logic in Computer Science, 1988."
8. Bruce, Kim B., and Longo, Giuseppe (1990), A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87, 196-240. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994. An earlier version appeared in "Proceedings of the IEEE Symposium on Logic in Computer Science, 1988."
9. Bruce, Kim B. (1994), A paradigmatic object-oriented programming language: Design, static typing and semantics, J. Funct. Programming 4(2). A preliminary version appeared in "POPL 1993" under the title "Safe Type Checking in a Statically Typed Object- Oriented Programming Language."
10. Bruce, Kim B. (1994), A paradigmatic object-oriented programming language: Design, static typing and semantics, J. Funct. Programming 4(2). A preliminary version appeared in "POPL 1993" under the title "Safe Type Checking in a Statically Typed Object-Oriented Programming Language."
11. Cardelli, Luca, and Longo, Giuseppe (1991), A semantic basis for Quest, J. Funct. Programming 1(4), 417-458. Preliminary version in "ACM Conference on Lisp and Functional Programming, June 1990." Also available as DEC SRC Research Report 55, Feb. 1990.
12. Cardelli, Luca, and Longo, Giuseppe (1991), A semantic basis for Quest, J. Funct. Programming 1(4), 417-458. Preliminary version in "ACM Conference on Lisp and Functional Programming, June 1990." Also available as DEC SRC Research Report 55, Feb. 1990.
13. Cardelli, Luca, and Mitchell, John (1991), Operations on records, Math. Struct. Comput Sci. 1, 3-48.
14. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994.
15. Available as DEC Systems Research Center Research Report #48, August 1989 and in "Proceedings of MFPS '89," Lecture Notes in Computer Science, Vol. 442, Springer-Verlag, Berlin/New York.
16. Cardelli, Luca, and Wegner, Peter (1985), On understanding types, data abstraction, and polymorphism, Comput Surveys 17(4).
17. Cardelli, Luca, Martini, Simone, Mitchell, John C., and Scedrov, André (1994), An extension of system F with subtyping, Inform, and Comput. 109(1-2), 4-56. A preliminary version appeared in "TACS '91, Sendai, Japan," pp. 750-770.
18. Cardelli, Luca, Martini, Simone, Mitchell, John C., and Scedrov, André (1994), An extension of system F with subtyping, Inform, and Comput. 109(1-2), 4-56. A preliminary version appeared in "TACS '91, Sendai, Japan," pp. 750-770.
19. Cardelli, Luca (1984), A semantics of multiple inheritance, in "Semantics of Data Types" (G. Kahn, D. MacQueen, and G. Plotkin, Eds.), Lecture Notes in Computer Science, Vol. 173, pp. 51-67, Springer-Verlag, Berlin/New York, 1984. Full version in Inform, and Comput. 76(2/3) (1988), 138-164.
20. Cardelli, Luca (1984), A semantics of multiple inheritance, in "Semantics of Data Types" (G. Kahn, D. MacQueen, and G. Plotkin, Eds.), Lecture Notes in Computer Science, Vol. 173, pp. 51-67, Springer-Verlag, Berlin/New York, 1984. Full version in Inform, and Comput. 76(2/3) (1988), 138-164.
21. <:, unpublished manuscript.
22. Cardelli, Luca (1992), Extensible records in a pure calculus of subtyping, research report 81, DEC Systems Research Center. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" ( Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994.
23. Cardelli, Luca (1992), Extensible records in a pure calculus of subtyping, research report 81, DEC Systems Research Center. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" ( Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994.
24. Compagnoni, Adriana B., and Pierce, Benjamin C. (1995), Multiple inheritance via intersection types, Math. Structures Comput. Sci., to appar. Preliminary version available as University of Edinburgh technical report ECS-LFCS-93-275 and Catholic University Nijmegen computer science technical report 93-18, Aug. 1993.
25. ∧ is decidable, Technical Report ECS-LFCS-94-281, LFCS, University of Edinburgh; in "Proceedings of CSL'94," Kazimierz, Poland, Lecture Notes in Computer Science, Vol. 933, Springer-Verlag, Berlin/New York.
26. Cook, William (1989), "A Denotational Semantics of Inheritance," Ph.D. thesis, Brown Univ.
27. ≤, Math. Structures Comput. Sci. 2, 55-91. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994.
28. ≤, Math. Structures Comput. Sci. 2, 55-91. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA, 1994.
29. de Bruijn, Nicolas 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.
30. Fisher, Kathleen, and Mitchell, John (1994), Notes on typed object-oriented programming, in "Proceedings of Theoretical Aspects of Computer Software, Sendai, Japan," Lecture Notes in Computer Science, Vol. 789, pp. 844-885, Springer-Verlag, Berlin/New York.
31. Gordon, Andrew D. (1994), "Functional Programming and Input/Output," Cambridge Univ. Press, Cambridge, UK.
32. Gunter, C. A. (1992), "Semantics of Programming Languages: Structures and Techniques," MIT Press, Cambridge, MA.
33. Hofmann, Martin, and Pierce, Benjamin (1995), A unifying type-theoretic framework for objects, J. Funct. Programming, to appear. Previous versions appeared in "Symposium on Theoretical Aspects of Computer Science, 1994," pp. 251-262, and under the title "An Abstract View of Objects and Subtyping (Preliminary Report)," as University of Edinburgh, LFCS technical report ECS-LFCS-92-226, 1992.
34. Hofmann, Martin, and Pierce, Benjamin (1995), A unifying type-theoretic framework for objects, J. Funct. Programming, to appear. Previous versions appeared in "Symposium on Theoretical Aspects of Computer Science, 1994," pp. 251-262, and under the title "An Abstract View of Objects and Subtyping (Preliminary Report)," as University of Edinburgh, LFCS technical report ECS-LFCS-92-226, 1992.
35. Hofmann, Martin, and Pierce, Benjamin (1995), A unifying type-theoretic framework for objects, J. Funct. Programming, to appear. Previous versions appeared in "Symposium on Theoretical Aspects of Computer Science, 1994," pp. 251-262, and under the title "An Abstract View of Objects and Subtyping (Preliminary Report)," as University of Edinburgh, LFCS technical report ECS-LFCS-92-226, 1992.
36. Kamin, Samuel N., and Reddy, Uday S. (1994), Two semantic models of object-oriented languages, in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), pp. 464-495, MIT Press, Cambridge, MA.
37. Leavens, Gary T., and Weihl, William E. (1995), Specification and Verification of Object-Oriented Programs using Supertype Abstraction, in "Acta Inform.," Vol. 32, N° 8, Nov. 1995, pp. 705-778.
38. Marti-Oliet, Narciso, and Meseguer, José ( 1990), Inclusions and subtypes, Technical Report SRI-CSL-90-16, Computer Science Laboratory, SRI International.
39. Naraschewski, Wolfgang, "Verifikation objektorientierter Programme mit LEGO," Studienarbeit, Universität Erlangen, 1995.
40. Oles, Frank J. (1985), Type algebras, functor categories, and block structures, in "Algebraic Methods in Semantics" (Maurice Nivat and John C. Reynolds, Eds.), Cambridge Univ. Press, Cambridge, UK.
41. Pierce, Benjamin and Steffen, Martin (1995), Higher-order subtyping, Theoretical Computer Science, to appear.
42. A preliminary version appeared in IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), June 1994, as as University of Edinburgh technical report ECS-LFCS-94-280 and Universität Erlangen-Nürnberg Interner Bericht IMMD7-01/94, January 1994.
43. Pierce, Benjamin C., and Turner, David N. (1994), Simple type-theoretic foundations for object-oriented programming, J. Funct. Programming 4(2), 207-247. A preliminary version appeared in "Principles of Programming Languages, 1993," and as University of Edinburgh technical report ECS-LFCS-92-225 under the title "Object-Oriented Programming Without Recursive Types."
44. Pierce, Benjamin C., and Turner, David N. (1994), Simple type-theoretic foundations for object-oriented programming, J. Funct. Programming 4(2), 207-247. A preliminary version appeared in "Principles of Programming Languages, 1993," and as University of Edinburgh technical report ECS-LFCS-92-225 under the title "Object-Oriented Programming Without Recursive Types."
45. Pierce, Benjamin C. (1994), Bounded quantification is undecidable, Inform. and Comput. 112(1), 131-165. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA. A preliminary version appeared in "POPL '92."
46. Pierce, Benjamin C. (1994), Bounded quantification is undecidable, Inform. and Comput. 112(1), 131-165. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA. A preliminary version appeared in "POPL '92."
47. Pierce, Benjamin C. (1994), Bounded quantification is undecidable, Inform. and Comput. 112(1), 131-165. Also in "Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design" (Carl A. Gunter and John C. Mitchell, Eds.), MIT Press, Cambridge, MA. A preliminary version appeared in "POPL '92."
48. Reynolds, John (1985), Three approaches to type structure, in "Mathematical Foundations of Software Development," Lecture Notes in Computer Science, Vol. 185, Springer-Verlag, Berlin/ New York.
49. Robinson, Edmund, and Tennent, Robert (1988), Bounded quantification and record-update problems. Message to Types electronic mail list.