Subtyping recursive types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 104-118

  Amadio, Roberto M ^a   Cardelli, Luca ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b Systems Research Center ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LANGUAGES; MODULA (PROGRAMMING LANGUAGE);

INCLUSION RELATION; MODERN LANGUAGES; OTHER PROPERTIES; RECURSIVE TYPES; STRUCTURAL TYPE; SUBCLASSING; SUBTYPING RECURSIVE TYPES; TYPE EQUIVALENCE;

OBJECT ORIENTED PROGRAMMING;

EID: 85028772254     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99600     Document Type: Conference Paper

References (20)

1. R. Amadio: Recursion over realizability structures, TR1 /89 Dipartimento di Informatica, Universitdi Piss, to appear in Info.&Comp. R. Amadio: Formal theories of inheritance for typed functional languages, TR 28/89 Dipartimento di Informatica, Universit di Piss.
2. R. Amadio: Typed equivalence, type assignment and type containment, abstract in Proc. CIRS90, eds. KaplankOkada, Montreal, June 1990.
3. A. Arnold, M. Nlvat: The metric space of infinite trees. Algebraic and topological properties, Fundamental Informaticae III pp.445-476, 1980.
4. V. Breazu-Tannenr C. Gunter, A. edrow Denotational semantics for subtyping between recursive types, Report MS-CIS 89 63, Logic of Computation 12, Dept of Computer & Information Science, University of Pennsylvania.
5. K. Bruce, G. Longo: A modest model of records, inheritance and bounded quantification, IEEELICS 88, Edinburgh.
6. L. Cardelli: Amber, in Combinators and Functional Programming Languages, Lecture Notes in Computer Science n. 242, Spnnger-Verlag, 1986.
7. L. Cardelli: A semantics of multiple inheritance, Info. &Comp., 76, pp.138-164.
8. L. Cardelli: Typeful programming, SRC Report #45, Digital Equipment Corporation, 1989.
9. L. Cardelli, J. Donahue, M. Jordan, B. Kalsow, G. Nelson: The Modula-3 type system, Proc. POPL89.
10. L. Cardelli, G. Longo: A semantic basis for Quest, Proc. of LISP& FP90, Nice.
11. F. Cardone, M. Coppo: Type inference with recursive types: syntax and semantics, Dipartimento di Informatica, Universitii di Tonno.
12. B. Courcelle: Fundamental properties of infinite trees, Theoretical Computer Science, 25, pp.95-169, 1983.
13. P.L. Curien, G. Ghelli: Coherence of Subsumption, CAAP 1990, Kdxmavn.
14. M. Hyland: A smali complete category, APAL 40, 2, pp.135-165.
15. D. MacQueen , G. Plotkin, R. Sethi: An ideal model for recursive polymorphic types, Info. &Comp., 71, 1-2.
16. R. Milner: A complete inference system for a class of regular behaviors, JCSS 28, pp. 439-466, 1984.
17. D. M. R. Park: Concurrency and automata on infinite sequences, Proc. 5th GI conference, LNCS 104 pp.167-183, Springer-Verlag, 1981.
18. A. Salomaa: Two complete systems for the algebra of regular events, JAMA 13, 1, 1966.
19. D. Scott : Continuous lattices, Toposes, Algebraic Geometry and Logic, Lawvere (cd.), LNM 274, pp.97-136, Springer-Verlagr 1972.
20. D. Scott : Data types as lattices, SIAM J. of Comp., 5, pp.522-587.