Roberto M. Amadio
- Amadio 89.R. Amadio: Recursion over realizability structures, TR1/89 Dipartimento di Informatica, Universit~ di Pisa, to appear in Info.&Comp. Google Scholar
Digital Library
- Amadio 89b.R. Amadio: Formal theories of inheritance for typed functional languages, TR 28/89 Dipartimento di Inforrnatica, Universit~ di Pisa.Google Scholar
- Amadio 90.R. Amadio: Typed equivalence, type assignment and type containment, abstract in Proc. CTRS90, eds. Kaplan&Okada, Montreal, June 1990. Google ScholarDigital Library
- Arnold Nivat 80.A.Arnold, M.Nivat: The metric space of infinite trees. Algebraic and topological properties, Fundamenta Informaticae III pp.445-476, 1980.Google Scholar
- Breazu-Tannen et al 89.V. Breazu-Tannen, C. Gunter, A. Scedrov: Denotational semantics for subtyping between reeursive types, Report MS-CIS 89 63, Logic of Computation 12, Dept of Computer & Information Science, University of Pennsylvania.Google Scholar
- Bruce Longo 88.K. Bruce, G. Longo: A modest model of records, inheritance and bounded quantification, IEEE- LICS 88, Edinburgh.Google Scholar
- Cardelli 86.L. Cardelli: Amber, in Combinators and Functional Programming Languages, Lecture Notes in Computer Science n. 242, Springer-Verlag, 1986. Google ScholarDigital Library
- Cardelli 88.L. Cardelli: A semantics of multiple inheritance, info.&Comp., 76, pp.138-164. Google ScholarDigital Library
- Cardelli 89.L.Cardelli: Typeful programming, SRC Report #45, Digital Equipment Corporation, 1989.Google Scholar
- Cardelli Donahue Jordan Kalsow Nelson 89.L.Cardelli, J.Donahue, M.jordan, B.Kalsow, G.Nelson: The Modula-3 type system, Proc. POPL'89. Google ScholarDigital Library
- Cardelli Longo 90.L.Cardelli, G.Longo: A semantic basis for Quest, Proc. of LISP&FP'90, Nice. Google ScholarDigital Library
- Cardone Coppo 89.F.Cardone, M.Coppo: Type inference with recursive types: syntax and semantics, Dipartimento di Informatica, Universit& di Torino.Google Scholar
- Courcelle 83.B.Courcelle: Fundamental properties of infinite trees, Theoretical Computer Science, 25, pp.95- 169, 1983.Google ScholarCross Ref
- Curien Ghelli 90.P.L. Curien, G. Ghelli: Coherence of Subsumption, CAAP 1990, Kobenavn. Google ScholarDigital Library
- Hyland 89.M. Hyland: A small complete category, APAL 40, 2, pp.135-165.Google Scholar
- MacQueen et al 86.D. MacQueen, G. Plotkin, R. Sethi: An ideal model for recursive polymorphic types, Info.&Comp., 71, 1-2. Google ScholarDigital Library
- Milner 84.R.Milner: A complete inference system for a class of regular behaviours, JCSS 28, pp. 439-466, 1984.Google ScholarCross Ref
- Park 81.D.M.R.Park: Concurrency and automata on infinite sequences, Proc. 5th GI conference, LNCS 104 pp.167-183, Springer-Verlag, 1981. Google ScholarDigital Library
- Salomaa 66.A. Salomaa: Two complete systems for the algebra of regular events, JACM 13,1, 1966. Google ScholarDigital Library
- Scott 72.D. Scott : Continuous lattices, Toposes, Algebraic Geometry and Logic, Lawvere (ed.), LNM 274, pp.97-136, Springer-Verlag, 1972.Google ScholarCross Ref
- Scott 76.D. Scott : Data types as lattices, SIAM J. of Comp., 5, pp.522-587.Google ScholarCross Ref
Index Terms
- Subtyping recursive types
Recommendations
Subtyping recursive types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the first question, ...
On subtyping, wildcards, and existential types
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsWildcards are an often confusing part of the Java type system: the behaviour of wildcard types is not fully specified by subtyping, due to wildcard capture, and the rules for type checking are often misunderstood. Their very formulation seems somehow '...
Subtyping Recursive Types in Kernel Fun - Abstract
LICS '99: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer ScienceThe problem of defining and checking a subtype relation between recursive types was studied by Amadio and Cardelli (ACM TOPLAS'93) for a first order type system, but for second order systems, which combine subtyping and parametric polymorphism, only ...
Comments