Higher-order subtyping and its decidability

Information and Computation

Volumn 191, Issue 1, 2004, Pages 41-103

  Compagnoni, Adriana ^a  

^a STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bounded polymorphism; Decidability; Higher order lambda calculus; Higher order subtyping; Intersection types

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; NUMERICAL METHODS; STATISTICAL METHODS; SYNTACTICS;

BOUNDED POLYMORPHISM; HIGH ORDER LAMBDA CALCULUS; HIGH ORDER SUBTYPING; INTERSECTION TYPES; MULTIPLE INHERITANCE; SYNTAX;

DIFFERENTIATION (CALCULUS);

EID: 2442640196     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.01.001     Document Type: Article

References (64)

1. M. Abadi, L. Cardelli, A Theory of Objects, Springer-Verlag, 1996.
2. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems 15 (4) (1993) 575-631, A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Research Report number 62, August 1990.
3. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems 15 (4) (1993) 575-631, A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Research Report number 62, August 1990.
4. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems 15 (4) (1993) 575-631, A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Research Report number 62, August 1990.
5. D. Aspinall, A.B. Compagnoni, Subtyping dependent types, In: Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996.
6. D. Aspinall, A.B. Compagnoni, Subtyping dependent types, Theoretical Computer Science 266 (1-2) (2001) 273-309.
7. H.P. Barendregt, Lambda calculi with types, in: in: T.S.E.MS. Abramsky, D.M. Gabbay (Eds.), Handbook of Logic in Computer Science, vol. 2, Clarendon Press, Oxford, 1992, pp. 117-309.
8. H.P. Barendregt, The Lambda Calculus, revised ed., North Holland, 1984.
9. H.P. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, Journal of Symbolic Logic 48 (4) (1983) 931-940.
10. G. Barthe, Order-sorted inductive types, Information and Computation 149 (1) (1999) 42-76.
11. G. Barthe, F. van Raamsdonk, Constructor subtyping in the calculus of inductive constructions, in: J. Tiuryn (Ed.), FOSSACS'00, number 1784 in LNCS, pages 17-34, 2000.
12. V. Breazu-Tannen, T. Coquand, C. Gunter, A. Scedrov, Inheritance as implicit coercion, Information and Computation 93 (1991) 172-221.
13. K.B. Bruce, J.C. Mitchell, PER models of subtyping, recursive types and higher-order polymorphism, in: Proceedings of the Nineteenth ACM Symposium on Principles of Programming Languages, Albequerque, NM, January 1992.
14. P. Canning, W. Cook, W. Hill, W. Olthoff, J. Mitchell, F-bounded quantification for object-oriented programming, in: Fourth International Conference on Functional Programming Languages and Computer Architecture, pp. 273-280, September 1989.
15. L. Cardelli, A semantics of multiple inheritance, Information and Computation 76 (1988) 138-164, Kahn, MacQueen, Plotkin (Eds.), Preliminary version in Semantics of Data Types, Springer-Verlag, LNCS 173, 1984.
16. L. Cardelli, A semantics of multiple inheritance, Information and Computation 76 (1988) 138-164, Kahn, MacQueen, Plotkin (Eds.), Preliminary version in Semantics of Data Types, Springer-Verlag, LNCS 173, 1984.
17. L. Cardelli, Types for data-oriented languages, in: First Conference on Extending Database Technology, Lecture Notes in Computer Science (vol. 303), Springer-Verlag, May 1988.
18. ω. Unpublished manuscript, October 1990.
19. L. Cardelli, Typeful programming, in: E.J. Neuhold, M. Paul (Eds.), Formal Description of Programming Concepts, Springer-Verlag, 1991, An earlier version appeared as DEC Systems Research Center Research Report #45, February 1989.
20. L. Cardelli, Typeful programming, in: E.J. Neuhold, M. Paul (Eds.), Formal Description of Programming Concepts, Springer-Verlag, 1991, An earlier version appeared as DEC Systems Research Center Research Report #45, February 1989.
21. L. Cardelli, J.C. Mitchell, Operations on records, Mathematical Structures in Computer Science 1 (1991) 3-48, Also in [42], and available as DEC Systems Research Center Research Report #48, August, 1989, and in the proceedings of MFPS '89, Springer LNCS volume 442.
22. L. Cardelli, J.C. Mitchell, Operations on records, Mathematical Structures in Computer Science 1 (1991) 3-48, Also in [42], and available as DEC Systems Research Center Research Report #48, August, 1989, and in the proceedings of MFPS '89, Springer LNCS volume 442.
23. L. Cardelli, J.C. Mitchell, Operations on records, Mathematical Structures in Computer Science 1 (1991) 3-48, Also in [42], and available as DEC Systems Research Center Research Report #48, August, 1989, and in the proceedings of MFPS '89, Springer LNCS volume 442.
24. L. Cardelli, P. Wegner, On understanding types, data abstraction, and polymorphism, Computing Surveys 17 (4) (1985).
25. F. Cardone, M. Coppo, Two extensions of Curry's type inference system, in: P. Odifreddi (Ed.), Logic and Computer Science, APIC Studies in Data Processing, vol. 31, Academic Press, 1990, pp. 19-76.
26. F. Cardone, M. Dezani-Ciancaglini, Combining type disciplines, Annals of Pure and Applied Logic 66 (3) (1994) 197-230.
27. G. Castagna, B.C. Pierce, Decidable bounded quantification, in: Proceedings of Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, OR. ACM, January 1994.
28. G. Castagna, B. Pierce, Corrigendum: Decidable bounded quantification, in: Proceedings of the Twenty-Second ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon. ACM, Jan. 1995.
29. G. Chen, Subtyping calculus of constructions, in: The 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS), August 1997.
30. A. Church, J.B. Rosser, Some properties of conversion, Transactions of the American Mathematical Society 39 (3) (1936) 472-482.
31. ω is decidable, Technical Report ECS-LFCS-94-281, LFCS, University of Edinburgh, January 1994.
32. A.B. Compagnoni, Decidability of higher-order subtyping with intersection types, in: Proceedings of the Annual Conference of the European Association for Computer Science Logic, CSL'94, Kazimierz, Poland, number 933 in Lecture Notes in Computer Science. Springer-Verlag, June 1995.
33. A.B. Compagnoni, Higher-Order Subtyping with Intersection Types. PhD thesis, University of Nijmegen, The Netherlands, January 1995. ISBN 90-9007860-6. Supervisors: Prof. Henk Barendregt and Prof. Mariangiola Dezani.
34. A.B. Compagnoni, Subject reduction and minimal types for higher order subtyping. Technical Report ECS-LFCS-97-363, University of Edinburgh, LFCS, August 1997.
35. A.B. Compagnoni, H.H. Goguen, Typed operational semantics for higher order subtyping, Information and Computation 184 (August) (2003) 242-297.
36. A.B. Compagnoni, B.C. Pierce, Higher-order intersection types and multiple inheritance, Mathematical Structures in Computer Science 6 (1996) 469-501, Preliminary version available under the title Multiple Inheritance via Intersection Types as University of Edinburgh tgechnical report ECS-LFCS-93-275 and Catholic University Nijmegen computer science technical report 93-18, Aug. 1993.
37. A.B. Compagnoni, B.C. Pierce, Higher-order intersection types and multiple inheritance, Mathematical Structures in Computer Science 6 (1996) 469-501, Preliminary version available under the title Multiple Inheritance via Intersection Types as University of Edinburgh tgechnical report ECS-LFCS-93-275 and Catholic University Nijmegen computer science technical report 93-18, Aug. 1993.
38. A.B. Compagnoni, B.C. Pierce, Higher-order intersection types and multiple inheritance, Mathematical Structures in Computer Science 6 (1996) 469-501, Preliminary version available under the title Multiple Inheritance via Intersection Types as University of Edinburgh tgechnical report ECS-LFCS-93-275 and Catholic University Nijmegen computer science technical report 93-18, Aug. 1993.
39. W.R. Cook, W.L. Hill, P.S. Canning, Inheritance is not subtyping, in: Seventeenth Annual ACM Symposium on Principles of Programming Languages, pp. 125-135, San Francisco, CA, January 1990. Also in [42].
40. M. Coppo, M. Dezani-Ciancaglini, A new type-assignment for λ-terms, Archive for Mathematical Logic 19 (1978) 139-156.
41. M. Coppo, M. Dezani-Ciancaglini, An extension of the basic functionality theory for the λ-calculus, Notre-Dame Journal of Formal Logic 21 (4) (1980) 685-693.
42. ≤, Mathematical Structures in Computer Science 2 (1992) 55-91.
43. N.G. de Bruijn, Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem, Indagationes Mathematicae 34 (5) (1972) 381-392.
44. K. Fisher, Type Systems For Object-Oriented Languages. PhD thesis, Computer Science, Stanford University, 1996. Supervisor: Prof. John Mitchell.
45. G. Ghelli, Proof Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism. PhD thesis, Università di Pisa, March 1990. Technical report TD-6/90, Dipartimento di Informatica, Università di Pisa.
46. G. Ghelli, B. Pierce, Bounded existentials and minimal typing, Theoretical Computer Science 193 (1998) 75-96.
47. J.-Y. Girard, Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII, 1972.
48. H.H. Goguen, A Typed Operational Semantics for Type Theory, PhD thesis, University of Edinburgh, Aug. 1994.
49. H.H. Goguen, Soundness of a typed operational semantics for the logical framework, in: Proceedings of the International Conference on Typed Lambda Calculi and Applications, Lecture Notes on Computer Science (vol. 1581), Springer-Verlag, 1999.
50. C.A. Gunter, J.C. Mitchell, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, The MIT Press, 1994.
51. J.R. Hindley, The Church-Rosser property and a result in combinatory logic. PhD thesis, University of Newcastle-upon-Tyne, 1964.
52. J. McKinna, R. Pollack, Pure type systems formalized, in: M. Bezem, J.F. Groote (Eds.), Proceedings of the International Conference on Typed Lambda Calculi and Applications, pp. 289-305. Springer-Verlag, LNCS 664, Mar. 1993.
53. J.C. Mitchell, Toward a typed foundation for method specialization and inheritance, in: Proceedings of the 17th ACM Symposium on Principles of Programming Languages, pp. 109-124, January 1990. Also in [42].
54. M.H.A. Newman, On theories with a combinatorial definition of equivalence, Annals of Mathematics 43 (2) (1942) 223-243.
55. B.C. Pierce, Programming with Intersection Types and Bounded Polymorphism. PhD thesis, Carnegie Mellon University, December 1991. Available as School of Computer Science technical report CMU-CS-91-205.
56. B.C. Pierce, M. Steffen, Higher-order subtyping, Theoretical Computer Science 176 (1-2) (1997) 235-282, Corrigendum in TCS vol. 184 (1997), p. 247.
57. B.C. Pierce, D.N. Turner, Simple type-theoretic foundations for object-oriented programming, Journal of Functional Programming 4 (2) (1994) 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".
58. B.C. Pierce, D.N. Turner, Simple type-theoretic foundations for object-oriented programming, Journal of Functional Programming 4 (2) (1994) 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".
59. B.C. Pierce, D.N. Turner, Simple type-theoretic foundations for object-oriented programming, Journal of Functional Programming 4 (2) (1994) 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".
60. J.C. Reynolds, Using category theory to design implicit conversions and generic operators, in: N.D. Jones (Ed.), Proceedings of the Aarhus Workshop on Semantics-Directed Compiler Generation, number 94 in Lecture Notes in Computer Science. Springer-Verlag, January 1980. Also in [42].
61. J.C. Reynolds, Preliminary design of the programming language Forsythe, Technical Report CMU-CS-88-159, Carnegie Mellon University, June 1988.
62. M. Steffen, B.C. Pierce, Higher-order subtyping, Technical Report ECS-LFCS-94-280, LFCS, University of Edinburgh, February 1994.
63. W.W. Tait, Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic 32 (2) (1967) 198-212.
64. J. Zwanenburg, Object-Oriented Concepts and Proof Rules: Formalization in Type Theory and Implementation in Yarrow. PhD thesis, Eindhoven University of Technology, 1999. Supervisor: Prof. Hemerik.