Rank-2 intersection and polymorphic recursion

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 146-161

  Damiani, Ferruccio ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

POLYMORPHIC RECURSION; RANK-2 INTERSECTION; RECURSIVE DEFINITIONS; TYPING RULES;

COMPUTATIONAL METHODS;

EID: 24944480821     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_12     Document Type: Conference Paper

References (23)

1. H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. of Symbolic Logic, 48:931-940, 1983.
2. S. Carlier, J. Polakow, J. B. Wells, and A. J. Kfoury. System E: Expansion variables for flexible typing with linear and non-linear types and intersection types. In ESOP'04, volume 2986 of LNCS, pages 294-309. Springer, 2004.
3. M. Coppo and M. Dezani-Ciancaglini. An extension of basic functional theory for lamb da-calculus. Notre Dame Journal of Formal Logic, 21(4):685-693, 1980.
4. P. Cousot. Types as Abstract Interpretations. In POPL'97, pages 316-331. ACM, 1997.
5. L. M. M. Damas and R. Milner. Principal type schemas for functional programs. In POPL'82, pages 207-212. ACM, 1982.
6. F. Damiani. Rank 2 intersection types for local definitions and conditional expressions. ACM Trans. Prog. Lang. Syst., 25(4):401-451, 2003.
7. J. Y. Girard. Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur. PhD thesis, Université Paris VII, 1972.
8. R. Gori and G. Levi. Properties of a type abstract interpreter. In VMCAI'03, volume 2575 of LNCS, pages 132-145. Springer, 2003.
9. J. J. Hallett and A. J. Kfoury. Programming examples needing polymorphic recursion. In ITRS'04 (workshop affiliated to LICS'04), ENTCS. Elsevier, to appear.
10. F. Henglein. Type inference with polymorphic recursion. ACM Trans. Prog. Lang. Syst., 15(2):253-289, 1993.
11. R. Hindley. Basic Simple Type Theory. Number 42 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, London, 1997.
12. T. Jim. Rank 2 type systems and recursive definitions. Technical Report MIT/LCS/TM-531, LCS, Massachusetts Institute of Technology, 1995.
13. T. Jim. What are principal typings and what are they good for? In POPL'96, pages 42-53. ACM, 1996.
14. T. Jim. A polar type system. In ICALP Workshops, volume 8 of Proceedings in Informatics, pages 323-338. Carleton-Scientific, 2000.
15. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type reconstruction in the presence of polymorphic recursion. ACM Trans. Prog. Lang. Syst., 15(2):290-311, 1993.
16. D. Leivant. Polymorphic Type Inference. In POPL'83, pages 88-98. ACM, 1983.
17. L. Meertens. Incremental polymorphic type checking in B. In POPL'83, pages 265-275. ACM, 1983.
18. A. Mycroft. Polymorphic Type Schemes and Recursive Definitions. In International Symposium on Programming, volume 167 of LNCS, pages 217-228. Springer, 1984.
19. J. C. Reynolds. Towards a Theory of Type Structure. In Colloque sur la Programmation, volume 19 of LNCS. Springer, 1974.
20. S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993.
21. S. van Bakel. Rank 2 types for term graph rewriting. In TIP'02, volume 75 of ENTCS. Elsevier, 2003.
22. J.B. Wells. The essence of principal typings. In ICALP'02, volume 2380 of LNCS, pages 913-925. Springer, 2002.
23. H. Yokouchi. Embedding a Second-Order Type System into an Intersection Type System. Information and Computation, 117:206-220, 1995.