Subtyping Recursive Types

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 15, Issue 4, 1993, Pages 575-631

  Amadio, Roberto M ^a   Cardelli, Luca ^b  

^a INRIA Lorraine Campus Scientifique   (France)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

coercions; lambda calculus; partial equivalence relations; recursive types; regular trees; subtyping; tree orderings; type equivalence; typechecking algorithm

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; EQUIVALENCE CLASSES; FORMAL LANGUAGES; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; RECURSIVE FUNCTIONS; THEOREM PROVING; TREES (MATHEMATICS);

COERCIONS; LAMBDA CALCULUS; PARTIAL EQUIVALENCE RELATIONS; SUBTYPING; TREE ORDERINGS; TYPECHECKING ALGORITHM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0027667776     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/155183.155231     Document Type: Article

References (30)

1. AMADIO, R. Formal theories of inheritance for typed functional languages. Tech. Rep. TR 28/89, Dip. di Informatica, Univ. di Pisa, Pisa, Italy, 1989.
2. AMADIO, R. Typed equivalence, type assignment and type containment. In Proceedings of Conditional and Typed Rewriting Systems 90. Lecture Notes in Computer Science, 516. Springer-Verlag, New York, 1990.
3. ACM Transactions on Programming Languages and Systems, Vol. 15, No 4, September 1993
4. AMADIO, R. Recursion over realizability structures. Inf. Comput. 91, 1 (1991), 55-85.
5. ARNOLD, A., AND NIVAT, M. The metric space of infinite trees. Algebraic and topological properties. Fundamenta Inf. III. (1980), 445-476.
6. BREAZU-TANNEN, V., COQUAND, T., GUNTER, C., AND SCEDROV, A. Inheritance as implicit coercion. Inf. Comput. 93, (1991), 172-221.
7. BREAZU-TANNEN, V., GUNTER, C., AND SCEDROV, A. Denotational semantics for subtyping between recursive types. Rep. MS-CIS 89 63, Logic of Computation 12, Dept. of Computer and Information Science, Univ. of Pennsylvania, Philadelphia, 1989.
8. BRUCE, K., AND LONGO, G. A modest model of records, inheritance and bounded quantification. Inf. Comput. 87, 1/2 (1990), 196-240.
9. CANNING, P., COOK, W., HILL, W., OLTHOFF, W., AND MITCHELL, J. C. F-bounded polymorphism for object-oriented programming. In Proceedings of Functional Programming and Computer Architecture 89. ACM Press, New York, 1989.
10. CARDELLI, L. A semantics of multiple inheritance. Inf. Comput. 76, (1988), 138-164.
11. CARDELLI, L. Amber, combinators and functional programming languages. In Proceedings of the 13th Summer School of the LITP, Le Val D'Ajol (Vosges, France, May 1985). Lecture Notes in Computer Science, 242. Springer-Verlag, New York, 1985.
12. CARDELLI, L. Typeful programming. In Formal Description of Programming Concepts, E. J. Neuhold and M. Paul, Eds. Springer-Verlag, New York, 1991, 431-507.
13. CARDELLI, L., AND LONGO, G. A semantic basis for Quest. J. Functional Program. 1, 4 (Oct. 1991), 417-458.
14. CARDELLI, L., AND WEGNER, P. On understanding types, data abstraction and polymorphism. ACM Comput. Surv. 17, 4 (Dec. 1985), 471-522.
15. CARDELLI, F., AND COPPO, M. Type inference with recursive types: Syntax and semantics. Inf. Comput. 92, 1, 48-80.
16. COOK, W. A denotational semantics of inheritance. Ph.D. dissertation, Brown Univ., Providence, R.I., 1989.
17. COURCELLE, B. Fundamental properties of infinite trees. Theor. Comput. Sci. 25, (1983), 95-169.
18. COURCELLE, B. Equivalence and transformation of regular systems-Applications to recursive program schemes and grammars. Theor. Comput. Sci. 42, (1986), 1-122.
19. CURIEN, P.-L., AND GHELLI, G. Coherence of subsumption, minimum typing and type checking in F=. Math. Struc. Comput. Sci. 2, (1992), 55-91.
20. HYLAND, M. A small complete category. Ann. Pure Appl. Logic 40, 2, (1989), 135-165.
21. MACQUEEN, D., PLOTKIN, G., AND SETHI, R. An ideal model for recursive polymorphic types. Inf. Comput. 71, (1986), 1-2.
22. MILNER, R. A complete inference system for a class of regular behaviors. J. Comput. Syst. Sci. 28 (1984), 439-466.
23. NELSON, G., ED. Systems Programming with Modula-3. Prentice-Hall, Englewood Cliffs, N.J., 1991.
24. PARK, D. M. R. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI conference. Lecture Notes in Computer Science, 104. Springer-Verlag, New York, 1981, 167-183.
25. PIERCE, B. C. Bounded quantification is undecidable. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1992, 305-315.
26. SALOMAA, A. TWO complete systems for the algebra of regular events. J. ACM 13, 1 (1966).
27. SCOTT, D. Continuous lattices. In Toposes, Algebraic Geometry and Logic. Lecture Notes in Mathematics 274. Springer-Verlag, New York, 1972, 97-136.
28. SCOTT, D. Data types as lattices. SIAM J. Comput. 5, (1976), 522-587.
29. VAN WIJNGAARDEN ET AL., EDS. Revised Report on the Algorithmic Language Algol68. Springer-Verlag, New York, 1976, 103-107.
30. WADSWORTH, C. The relation between computational and denotational properties for Scott's D(models of the lambda-calculus. SIAM J. Comput. 5, (1976), 488-521.