Typed operational semantics for higher-order subtyping

Information and Computation

Volumn 184, Issue 2, 2003, Pages 242-297

  Compagnoni, Adriana ^a   Goguen, Healfdene ^b  

^a Stevens Institute of Technology   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Dependent kinds; Subtyping; Type theory; Typed operational semantics; Calculus

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; OBJECT ORIENTED PROGRAMMING;

TYPED OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 0041672222     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00062-2     Document Type: Article

References (54)

1. M. Abadi, L. Cardelli, On subtyping and matching, in: ECOOP'95, Springer, 1995, pp. 145-167.
2. M. Abadi, L. Cardelli, A Theory of Objects, Springer, 1996.
3. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Trans. Program. Lang. Syst. 15 (4) (1993) 575-631.
4. D. Aspinall, A. Compagnoni, Subtyping dependent types, in: 11th Annual Symposium on Logic in Computer Science, July 1996, IEEE, New Brunswick, NJ.
5. D. Aspinall, A.B. Compagnoni, Subtyping dependent types, Theoret. Comput. Sci. 266 (1-2) (2001) 273-309.
6. H. Barendregt, Lambda calculi with types, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Clarendon Press, Oxford, 1992, pp. 117-309.
7. H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48 (4) (1983) 931-940.
8. K.B. Bruce, Typing in object-oriented languages: achieving expressiveness and safety, June 1996, Unpublished.
9. K.B. Bruce, G. Longo, A modest model of records, inheritance, and bounded quantification, Inf. Comput. 87 (1990) 196-240.
10. K.B. Bruce, J. Mitchell, PER models of subtyping, recursive types and higher-order polymorphism, in: Proceedings of the 19th ACM Symposium on Principles of Programming Languages, Albequerque, NM, January 1992.
11. K.B. Bruce, A. Schuett, R. van Gent, PolyTOIL: a type-safe polymorphic object-oriented language, in: ECOOP'95, Springer, 1995.
12. L. Cardelli, A semantics of multiple inheritance, Inf. Comput. 76 (1988) 138-164.
13. L. Cardelli, Types for data-oriented languages, First Conference on Extending Database Technology, Lecture Notes in Computer Science, vol. 303, Springer, 1988.
14. ω, October 1990, Unpublished manuscript.
15. L. Cardelli, Typeful programming, in: E.J. Neuhold, M. Paul (Eds.), Formal Description of Programming Concepts, Springer, 1991.
16. L. Cardelli, Extensible records in a pure calculus of subtyping, Research Report 81, DEC Systems Research Center, January 1992, Also in [37].
17. L. Cardelli, G. Longo, A semantic basis for quest, J. Funct. Program. 1 (4) (1991) 417-458.
18. L. Cardelli, J. Mitchell, Operations on records, Math. Struct. Comput. Sci. 1 (1991) 3-48.
19. L. Cardelli, P. Wegner, On understanding types data abstraction and polymorphism (Also in [37], and available as DEC Systems Research Center Research Report #48, August, 1989, and in the Proceedings of MFPS'89, Lecture Notes in Computer Science, vol. 442, Springer), Comput. Surv. 17 (4) (1985).
20. G. Chen, Subtyping calculus of constructions, in: Proceedings of Mathematical Foundations of Computer Science, 1997.
21. A.B. Compagnoni, H. Goguen, Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, University of Edinburgh, July 1997.
22. A.B. Compagnoni, Decidability of higher-order subtyping with intersection types, in: CSL'94, Lecture Notes in Computer Science, vol. 933, Springer-Berlin, 1995.
23. A.B. Compagnoni, Higher-order subtyping with intersection types, PhD thesis, University of Nijmegen, The Netherlands, January 1995, Supervisor: Prof. Barendregt. ISBN 90-9007860-6.
24. A.B. Compagnoni, H. Goguen, Anti-symmetry of higher-order subtyping (Preliminary version available as University of Edinburgh Technical Report ECS-LFCS-94-281, January 1994), in: Proceedings of Computer Science Logic, Lecture Notes in Computer Science, vol. 1683, Springer, 1999.
25. A.B. Compagnoni, B.C. Pierce, Higher-order intersection types and multiple inheritance, Math. Struct. Comput. Sci. 6 (1996) 469-501.
26. T. Coquand, An algorithm for testing conversion in type theory, in; G. Huet, G. Plotkin (Eds.), Logical Frameworks, Cambridge University Press, 1991.
27. T. Coquand, J. Gallier, A proof of strong normalization for the theory of constructions using a Kripke-like interpretation, in: Workshop on Logical Frameworks - Preliminary Proceedings, 1990.
28. J. Courant, An applicative module calculus, in: Theory and Practice of Software Development 97, Lecture Notes in Computer Science, Springer, 1997.
29. ≤, Math. Struct. Comput. Sci. 2 (1992) 55-91.
30. M. Dezani-Ciancaglini, I. Margaria, A characterisation of F-complete type assignments, Theoret. Comput. Sci. 45 (1986) 121-157.
31. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge University Press, 1989.
32. H. Goguen, A typed operational semantics for type theory, PhD thesis, University of Edinburgh, August 1994.
33. H. Goguen, The metatheory of UTT, in: Types for Proofs and Programs, Lecture Notes in Computer Science, vol. 996, Springer, Baastad, Sweden, 1995, pp. 60-82.
34. H. Goguen, Typed operational semantics, in: Proceedings of the International Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 902, Springer, 1995, pp. 186-200.
35. H. Goguen, A Kripke-style model for the admissibility of structural rules, in: Proceedings of TYPES, vol. 2277, Springer, 2000.
36. T.M.W. Group, Principles and a Preliminary Design for ML2000 (March) (1999).
37. C.A. Gunter, J.C. Mitchell, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, The MIT Press, 1994.
38. R. Harper, M. Lillibridge, A type-theoretic approach to higher-order modules with sharing, in: Proceedings of the 21st ACM Symposium on Principles of Programming Languages, Portland, OR, January 1994, pp. 123-137.
39. A. Jones, Z. Luo, S. Soloviev, Some algorithmic and proof - theoretical aspects of coercive subtyping, in: E. Giménez, C. Paulin-Mohring (Eds.), in: Proceedings of TYPES'96, Lecture Notes in Computer Science, vol. 1512, 1996.
40. M.P. Jones, A system of constructor classes: overloading and implicit higher-order polymorphism, J. Funct. Prog. 5 (1) (1995) 1-35.
41. X. Leroy, Applicative functors and fully transparent higher-order modules, in: Proceedings of the 22nd Symposium on Principles of Programming Languages, ACM Press, 1995, pp. 142-153.
42. D. MacQueen, Using dependent types to express modular structure, in: Proceedings of the 13th ACM Symposium on the Principles of Programming Languages, 1986.
43. P. Martin-Löf, An intuitionistic theory of types, 1972, Unpublished manuscript.
44. J. McKinna, R. Pollack, Pure type systems formalized, in: M. Bezem, J.F. Groote (Eds.), in: Proceedings of the International Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 664, Springer, 1993, pp. 289-305.
45. J. Mitchell, Type systems for programming languages, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990.
46. J.C. Mitchell, Toward a typed foundation for method specialization and inheritance, in: Proceedings of the 17th ACM Symposium on Principles of Programming Languages, January 1990, pp. 109-124.
47. J.C. Mitchell, F. Honsell, K. Fisher, A lambda calculus of objects and method specialization, in: 1993 IEEE Symposium on Logic in Computer Science, June 1993.
48. B. Pierce, M. Steffen, Higher-order subtyping. Theoret. Comput. Sci. 176 (1-2) (1997) 235-282.
49. 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.
50. C. Russo, Types for modules. PhD thesis, University of Edinburgh, June 1998
51. T. Streicher, Semantics of Type Theory: Correctness, Completeness and Independence Results, Birkhäuser, 1991.
52. W.W. Tait, Intensional interpretation of functionals of finite type I, J. Symbolic Logic 32 (1967).
53. M. Takahashi, Parallel reductions in λ-calculus, Inf. Comput. 118 (1995) 120-127.
54. M. Wand, Complete type inference for simple objects, in: E.G. Manes (Ed.), in: Proceedings of the IEEE Symposium on Logic in Computer Science, Lecture Notes in Computer Science, vol. 25, IEEE Computer Society Press, Ithaca, NY, 1987, pp. 37-44.