Type inference with recursive type equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2030, Issue , 2001, Pages 184-198

  Coppo, Mario ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Recursive types; Type assignment

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EQUIVALENCE RELATIONS; LAMBDA TERMS; RECURSIVE TYPES; TYPE ASSIGNMENT; TYPE INFERENCES;

COMPUTATION THEORY;

EID: 84945318591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_12     Document Type: Conference Paper

References (12)

1. M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. In P. de Groote and J. R. Hindley, editors, Typed Lambda Calculi and Applications, volume 1210 of Lecture Notes in Computer Science, pages 63-81. Springer-Verlag, 1997.
2. V. Breazu-Tannen and A. Meyer. Lambda calculus with constrained types. In R. Parikh, editor, Logics of Programs, volume 193 of Lecture Notes in Computer Science, pages 23-40. Springer-Verlag, 1985.
3. F. Cardone and M. Coppo: Type inference with recursive types. Syntax and Semantics. Information and Computation, 92(1):48-80, 1991.
4. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95-169, 1983.
5. J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, 1969.
6. J.W. Klop. Term rewriting systems. In Dov M. Gabbay S. Abramsky and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, pages 1-116. Oxford University Uress, New York, 1992.
7. M. Marz. An algebraic view on recursive types. Applied Categorical Structures, 7(12):147-157, 1999.
8. R. Milner. A Theory of Type Polimorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.
9. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.
10. D. Scott. Some philosophical issues concerning theories of combinators. In C. Böhm, editor, Lambda calculus and computer science theory, volume 37 of Lecture Notes in Computer Science, pages 346-366. Springer-Verlag, 1975.
11. R. Statman: Recursive types and the subject reduction theorem. Technical Report 94-164, Carnegie Mellon University, 1994.
12. B. Pierce, V. Gapeyev, M. Levin. Recursive subtyping revealed. In Proceedings fifth ACM SIGPLAN International Conference on Functional Programming, pages 221-232. ACM press, 2000.