Typing local definitions and conditional expressions with rank 2 intersection

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

Volumn 1784 LNCS, Issue , 2000, Pages 82-97

  Damiani, Ferruccio ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CASE EXPRESSION; CONDITIONAL EXPRESSIONS; INTERSECTION TYPES; RANK-2 INTERSECTION; TYPING RULES; EXTENDED ABSTRACTS;

COMPUTATION THEORY;

EID: 84878633479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_6     Document Type: Conference Paper

References (15)

1. S. Aditya and R. Nikhil. Incremental polymorphism. In POPL'93, LNCS 523, pages 379-405. Springer-Verlag, 1991.
2. M. Coppo and P. Giannini. Principal Types and Unification for Simple Intersection Types Systems. Information and Computation, 122(1): 70-96, 1995.
3. L. M. M. Damas and R. Milner. Principal type schemas for functional programs. In POPL'82, pages 207-212. ACM, 1982.
4. F. Damiani and P. Giannini. A Decidable Intersection Type System based on Relevance. In TACS' 94, LNCS 789, pages 707-725. Springer-Verlag, 1994.
5. R. Hindley. Basic Simple Type Theory. Number 42 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, London, 1997.
6. T. Jim. Rank 2 type systems and recursive definitions. Technical Report MIT/LCS/TM-531, LCS, Massachusetts Institute of Technology, 1995.
7. T. Jim. What are principal typings and what are they good for? In POPL'96, pages 42-53. ACM, 1996.
8. A. J. Kfoury and J. B. Wells. A direct algorithm for type inference in the rank-2 fragment of the second-order lambda-calculus. In LISP and Functional Programming '94. ACM, 1994.
9. A. J. Kfoury and J. B. Wells. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL'99. ACM, 1999.
10. D. Leivant. Polymorphic Type Inference. In POPL'83. ACM, 1983.
11. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML - Revised. MIT press, 1997.
12. A. Mycroft. Polymorphic Type Schemes and Recursive Definitions. In International Symposium on Programming, LNCS 167, pages 217-228. Springer-Verlag, 1984.
13. Z. Shao and A. W. Appel. Smartest recompilation. In POPL'93, pages 439-450. ACM, 1993. (Pubitemid 23631624)
14. S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993.
15. H. Yokouchi. Embedding a Second-Order Type System into an Intersection Type System. Information and Computation, 117: 206-220, 1995.