Higher-order subtyping

Theoretical Computer Science

Volumn 176, Issue 1-2, 1997, Pages 235-282

  Pierce, Benjamin ^a   Steffen, Martin ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Bounded quantification; Lambda calculus; Polymorphism; Subtyping; Type systems; Typechecking

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; OBJECT ORIENTED PROGRAMMING; PROGRAMMING THEORY;

BOUNDED QUANTIFICATION; LAMBDA CALCULUS; SUBTYPING;

FORMAL LANGUAGES;

EID: 0031119355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00096-5     Document Type: Article

References (56)

1. M. Abadi and L. Cardelli, A Theory of Objects (Springer, Berlin, 1996), to appear.
2. H. Barendregt The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103 (North-Holland, Amstrerdam, revised ed., 1984).
3. V. Breazu-Tannen, T. Coquand, C. Gunter and A. Scedrov, Inheritance as implicit coercion, Inform. and Comput. 93 (1991) 172-221; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
4. V. Breazu-Tannen, T. Coquand, C. Gunter and A. Scedrov, Inheritance as implicit coercion, Inform. and Comput. 93 (1991) 172-221; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
5. K.B. Bruce, A paradigmatic object-oriented programming language: design, static typing and semantics, J. Funct. Programming 4(2) (1994); A preliminary version: Safe type checking in a statically typed object-oriented programming language, in: POPL 1993.
6. K.B. Bruce and G. Longo, A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87 (1990) 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, Cambridge, MA, 1994). An earlier version appeared in Proc. IEEE Symp. on Logic in Computer Science (1988).
7. K.B. Bruce and G. Longo, A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87 (1990) 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, Cambridge, MA, 1994). An earlier version appeared in Proc. IEEE Symp. on Logic in Computer Science (1988).
8. K.B. Bruce and G. Longo, A modest model of records, inheritance, and bounded quantification, Inform. and Comput. 87 (1990) 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, Cambridge, MA, 1994). An earlier version appeared in Proc. IEEE Symp. on Logic in Computer Science (1988).
9. K. Bruce and J. Mitchell, PER models of subtyping, recursive types and higher-order polymorphism, in: Proc. 19th ACM Symp. on Principles of Programming Languages (Albequerque, NM, 1992).
10. P. Canning, W. Cook, W. Hill, W. Olthoff and J. Mitchell, F-bounded quantification for object-oriented programming, in: 4th Internat. Conf. on Functional Programming Languages and Computer Architecture (1989) 273-280.
11. L. Cardelli, A semantics of multiple inheritance, in: G. Kahn, D. MacQueen and G. Plotkin, eds., Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173 (Springer, Berlin, 1984) 51-67. Full version in: Inform. and Comput. 76(2/3) (1988) 138-164.
12. L. Cardelli, A semantics of multiple inheritance, in: G. Kahn, D. MacQueen and G. Plotkin, eds., Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173 (Springer, Berlin, 1984) 51-67. Full version in: Inform. and Comput. 76(2/3) (1988) 138-164.
13. L. Cardelli, Structural subtyping and the notion of power type, in: Proc. 15th ACM Symp. on Principles of Programming Languages (San Diego, CA, 1988) 70-79.
14. <:, unpublished manuscript, 1990.
15. L. Cardelli and G. Longo, A semantic basis for Quest. J. Funct. Programming 1(4) (1991) 417-458; preliminary version in: ACM Conf. on Lisp and Functional Programming (1990); also available as DEC SRC Research Report 55, February 1990.
16. L. Cardelli and G. Longo, A semantic basis for Quest. J. Funct. Programming 1(4) (1991) 417-458; preliminary version in: ACM Conf. on Lisp and Functional Programming (1990); also available as DEC SRC Research Report 55, February 1990.
17. L. Cardelli and G. Longo, A semantic basis for Quest. J. Funct. Programming 1(4) (1991) 417-458; preliminary version in: ACM Conf. on Lisp and Functional Programming (1990); also available as DEC SRC Research Report 55, February 1990.
18. L. Cardelli, S. Martini, J.C. Mitchell and A. Scedrov, An extension of system F with subtyping, Inform. and Comput. 109(1-2)(1994) 4-56; a preliminary version in: TACS '91 (Sendai, Japan, 1991) 750- 770.
19. L. Cardelli, S. Martini, J.C. Mitchell and A. Scedrov, An extension of system F with subtyping, Inform. and Comput. 109(1-2)(1994) 4-56; a preliminary version in: TACS '91 (Sendai, Japan, 1991) 750-770.
20. L. Cardelli and P. Wegner, On understanding types, data abstraction, and polymorphism, Computing Surveys 17(4) (1985).
21. F. Cardone and M. Coppo, Two extensions of Curry's type inference system, In: P. Odifreddi, ed., Logic and Computer Science (Academic Press, New York, 1990) 19-76.
22. G. Castagna and B. Pierce, Decidable bounded quantification, in: Proc. 21st ACM Symp. on Principles of Programming Languages (POPL), Portland, Oregon (ACM, New York, 1994).
23. G. Castagna and B. Pierce, Corrigendum: decidable bounded quantification, in: Proc. 22nd ACM Symp. on Principles of Programming Languages (POPL), Portland, Oregon. (ACM, New York, 1995).
24. A. Church, A formulation of the simple theory of types, J. Symbolic Logic 5 (1940) 56-68.
25. ∧ is decidable. Tech. Report ECS-LFCS-94-281, LFCS, University of Edinburgh, 1994; Decidability of higher-order subtyping with intersection types, Proc. Computer Science Logic (1994), to appear.
26. ∧ is decidable. Tech. Report ECS-LFCS-94-281, LFCS, University of Edinburgh, 1994; Decidability of higher-order subtyping with intersection types, Proc. Computer Science Logic (1994), to appear.
27. A.B. Compagnoni, Higher-order subtyping with intersection types, Ph.D. Thesis, Catholic University, Nijmegen, 1995.
28. A.B. Compagnoni and B.C. Pierce, Multiple inheritance via intersection types, Math. Struct. Comput. Sci. (1995), to appear; preliminary version available as University of Edinburgh Tech. Report ECS-LFCS-93-275 and Catholic University Nijmegen computer science Tech. Report 93-18, 1993.
29. W.R. Cook, W.L. Hill and P.S. Canning, Inheritance is not subtyping, in: 17th Annual ACM Symp. on Principles of Programming Languages (San Francisco, CA, 1990) 125-135; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
30. W.R. Cook, W.L. Hill and P.S. Canning, Inheritance is not subtyping, in: 17th Annual ACM Symp. on Principles of Programming Languages (San Francisco, CA, 1990) 125-135; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
31. M. Coppo and M. Dezani-Ciancaglini, A new type-assignment for λ-terms. Arch. Math. Logik 19 (1978) 139-156.
32. ≤, in: T. Ito and A.R. Meyer, eds., Theoretical Aspects of Computer Software (Sendai, Japan) Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) 731-749.
33. ≤, Math. Struct. Comput. Sci. 2 (1992) 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, Cambridge, MA, 1994).
34. ≤, Math. Struct. Comput. Sci. 2 (1992) 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, Cambridge, MA, 1994).
35. J.H. Gallier, On Guard's "candidats de reductibilité", in: P. Odifreddi, ed., Logic and Computer Science (Academic Press New York, 1990) 123-203.
36. G. Ghelli, Proof theoretic studies about a minimal type system integrating inclusion and parametric polymorphism, Ph.D. Thesis, Università di Pisa, March 1990; Tech. Report TD-6/90, Dipartimento di Informatica, Università di Pisa.
37. ≤, in: Typed Lambda Calculus and Applications (1993).
38. ≤ type checking, Theoret. Comput. Sci. 139(1,2) (1995) 131-162.
39. G. Ghelli and B. Pierce, Bounded existentials and minimal typing, Theoret. Comput. Sci. to appear.
40. J.-Y. Girard, Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur, Ph.D. Thesis, Université Paris VII, 1972.
41. J.-Y. Girard, Y. Lafont and P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Vol. 7 (Cambridge University Press, Cambridge, 1989).
42. M. Hofmann and B. Pierce, A unifying type-theoretic framework for objects, J. Funct. Programming (1995); previous versions: Symp. on Theoretical Aspects of Computer Science (1994) 251-262; An abstract view of objects and subtyping (preliminary report), LFCS Tech. Report ECS-LFCS-92-226, University of Edinburgh, 1992.
43. M. Hofmann and B. Pierce, A unifying type-theoretic framework for objects, J. Funct. Programming (1995); previous versions: Symp. on Theoretical Aspects of Computer Science (1994) 251-262; An abstract view of objects and subtyping (preliminary report), LFCS Tech. Report ECS-LFCS-92-226, University of Edinburgh, 1992.
44. M. Hofmann and B. Pierce, A unifying type-theoretic framework for objects, J. Funct. Programming (1995); previous versions: Symp. on Theoretical Aspects of Computer Science (1994) 251-262; An abstract view of objects and subtyping (preliminary report), LFCS Tech. Report ECS-LFCS-92-226, University of Edinburgh, 1992.
45. S. Martini, Bounded quantifiers have interval models, in: Proc. ACM Conf. on Lisp and Functional Programming (Snowbird, Utah, 1988) (ACM, New York, 1988) 174-183.
46. J.C. Mitchell, Toward a typed foundation for method specialization and inheritance, in: Proc. 17th ACM Symp. on Principles of Programming Languages (1990) 109-124; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
47. J.C. Mitchell, Toward a typed foundation for method specialization and inheritance, in: Proc. 17th ACM Symp. on Principles of Programming Languages (1990) 109-124; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994).
48. P. Odifreddi, ed., Logic and Computer Science, APIC Studies in Data Processing, Vol. 31 (Academic Press, New York, 1990).
49. B.C. Pierce, Programming with intersection types and bounded polymorphism, Ph.D. Thesis, Carnegie Mellon University, 1991; available as School of Computer Science Tech. Report CMU-CS-91-205.
50. B.C. Pierce, Bounded quantification is undecidable, Inform. and Comput. 112(1) (1994) 131-165; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994); a preliminary version appeared in: POPL '92.
51. B.C. Pierce, Bounded quantification is undecidable, Inform. and Comput. 112(1) (1994) 131-165; also in: C.A. Gunter and J.C. Mitchell, eds., Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, Cambridge, MA, 1994); a preliminary version appeared in: POPL '92.
52. B.C. Pierce and D.N. Turner, Statically typed friendly functions via partially abstract types, Tech. Report ECS-LFCS-93-256, University of Edinburgh, LFCS, 1993; also available as INRIA-Rocquencourt Rapport de Recherche No. 1899.
53. B.C. Pierce and D.N. Turner, Simple type-theoretic foundations for object-oriented programming, J. Funct. Programming 4(2) (1994) 207-247; a preliminary versions: Principles of Programming Languages (1993); Object-oriented programming without recursive types, University of Edinburgh Tech. Report ECS-LFCS-92-225.
54. B.C. Pierce and D.N. Turner, Simple type-theoretic foundations for object-oriented programming, J. Funct. Programming 4(2) (1994) 207-247; a preliminary versions: Principles of Programming Languages (1993); Object-oriented programming without recursive types, University of Edinburgh Tech. Report ECS-LFCS-92-225.
55. J. Reynolds, Towards a theory of type structure, in: Proc. Colloque sur la Programmation, Lecture Notes in Computer Science, Vol. 17 (Springer, New York, 1974) 408-425.
56. P. Severi and E. Poll, Pure type systems with definitions, Computing science note 93/24, Eindhoven University of Technology, September 1993.