On typability for rank-2 intersection types with polymorphic recursion

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 111-120

  Terauchi, Tachio ^a   Aiken, Alex ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS PROBLEM; MILNER-MYCROFT TYPE SYSTEM; PROGRAM ANALYSIS; UNDECIDABILITY RESULT;

COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA REDUCTION; PROBLEM SOLVING; TURING MACHINES;

GRAPH THEORY;

EID: 34547346635     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.41     Document Type: Conference Paper

References (17)

1. F. Damiani. Rank-2 intersection and polymorphic recursion. In Typed Lambda Calculi and Applications: 7th International Conference (TLCA 2005), volume 3461 of LNCS, pages 146-161. Springer, Apr. 2005.
2. J. J. Hallett and A. J. Kfoury. Programming examples needing polymorphic recursion. In In Proceedings 3rd International Workshop Intersection Types and Related Systems (ITRS 2004), pages 57-102, 2004.
3. F. Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, Apr. 1993.
4. T. Jim. Rank 2 type systems and recursive definitions. Technical Report MIT/LCS/TM-531, Cambridge, MA, USA, 1995.
5. T. Jim. What are principal typings and what are they good for? In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 42-53, St. Petersburg Beach, Florida, Jan. 1996.
6. A. J. Kfoury, H. G. Mairson, F. A. Turbak, and J. B. Wells. Relating typability and expressiveness in finite-rank intersection type systems (extended abstract). In Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming, pages 90-101, Paris, France, Sept. 1999.
7. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Information and Computation, 102(1):83-101, 1993.
8. A. J. Kfoury and J. B. Wells. Principality and type inference for intersection types using expansion variables. Theoretical Computer Science, 311:1-70, 2004.
9. D. Leivant. Polymorphic type inference. In Proceedings of the 10th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 88-98, Austin, Texas, 1983.
10. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proceedings of the 6th International Conference on Programming, number 167 in LNCS, 1984.
11. J. Palsberg and P. O'Keefe. A type system equivalent to flow analysis. In Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 367-378, San Francisco, California, Jan. 1995.
12. J. Palsberg and C. Pavlopoulou. From polyvariant flow information to intersection and union types. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 197-208, San Diego, California, Jan. 1998.
13. J. Rehof and M. Fähndrich. Type-based flow analysis: From polymorphic subtyping to cfl-reachability. In Proceedings of the 28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 54-66, London, United Kingdom, Jan. 2001.
14. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11/12):701-726, November/December 1998.
15. T. Reps. Undecidability of context-sensitive data-dependence analysis. ACM Transactions on Programming Languages and Systems, 22(1): 162-186, 2000.
16. T. Terauchi and A. Aiken. On typability for rank-2 intersection types with polymorphic recursion. Technical Report UCB/EECS-2006-66, University of California, Berkeley, May 2006.
17. J. B. Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, volume 2380 of LNCS, pages 913-925. Springer-Verlag, 2002.