Principality and type inference for intersection types using expansion variables

Theoretical Computer Science

Volumn 311, Issue 1-3, 2004, Pages 1-70

  Kfoury, A J ^a   Wells, J B ^b  

^a BOSTON UNIVERSITY   (United States)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS;

EXPANSION VARIABLES; PRINCIPAL TYPINGS;

COMPUTER SCIENCE;

EID: 0346969704     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.032     Document Type: Article

References (33)

1. Amadio R., Curien P.-L. Domains and Lambda Calculi. Cambridge Tracts in Theoretical Computer Science. Vol. 41:1998;Cambridge University Press, Cambridge.
2. A. Banerjee, A modular, polyvariant, and type-based closure analysis, in: Proc. 1997 Int. Conf. Functional Programming, ACM Press, New York, 1997.
3. Coppo M., Dezani-Ciancaglini M. An extension of the basic functionality theory for the. λ -calculus Notre Dame J. Formal Logic. 21(4):1980;685-693.
4. M. Coppo, M. Dezani-Ciancaglini, B. Venneri, Principal type schemes and λ -calculus semantics, in: Hindley and Seldin (Eds.), Essays on Combinatory Logic, Lambda, Calculus, and Formation, Academic Press, New York, pp. 535-560.
5. Coppo M., Dezani-Ciancaglini M., Venneri B. Functional characters of solvable terms. Z. Math. Logik Grundlag. Math. 27(1):1981;45-58.
6. M. Coppo, P. Giannini, A complete type inference algorithm for simple intersection types, in: 17th Colloq. Trees in Algebra and Programming, Lecture Notes in Computer Science, Vol. 581, Springer, Berlin, 1992, pp. 102-123.
7. L. Damas, R. Milner, Principal type schemes for functional programs, in: Conf. Rec. 9th Ann. ACM Symp. Princ. of Prog. Langs., 1982, pp. 207-212.
8. Gosling J., Joy B., Steele G. The Java Language Specification. 1996;Addison-Wesley, Reading, MA.
9. J.R. Hindley, J.P. Seldin (Eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, Academic Press, New York, 1980.
10. T. Jensen, Inference of polymorphic and conditional strictness properties, in: Conf. Rec. POPL '98: 25th ACM Symp. Princ. of Prog. Langs., 1998.
11. T. Jim, What are principal typings and what are they good for?, in: Conf. Rec. POPL '96: 23rd ACM Symp. Princ. of Prog. Langs., 1996.
12. Jacobs B., Margaria I., Zacchi M. Filter models with polymorphic types. Theoret. Comput. Sci. 95:1992;143-158.
13. A.J. Kfoury, Beta-reduction as unification, A refereed extensively edited version is [14]. This preliminary version was presented at the Helena Rasiowa Memorial Conference, July 1996.
14. A.J. Kfoury, Beta-reduction as unification, in: D. Niwinski (Ed.), Logic, Algebra, and Computer Science (H. Rasiowa Memorial Conference, December 1996), Banach Center Publication, Vol. 46, Springer, Berlin, 1999, pp. 137-158. Supersedes [13] but omits a few proofs included in the latter.
15. A.J. Kfoury, J.B. Wells, A direct algorithm for type inference in the rank-2 fragment of the second-order λ -calculus, in: Proc. 1994 ACM Conf. LISP Funct. Program., 1994, pp. 196-207.
16. A.J. Kfoury, J.B. Wells, Principality and decidable type inference for finite-rank intersection types, in: Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999, pp. 161-174, superseded by [17].
17. A.J. Kfoury, J.B. Wells, Principality and Type Inference for Intersection Types Using Expansion Variables, supersedes [16], August 2003.
18. D. Leivant, Polymorphic type inference, in: Conf. Rec. 10th Ann. ACM Symp. Princ. of Prog. Langs., 1983, pp. 88-98.
19. Milner R., Tofte M., Harper R., MacQueen D.B. The Definition of Standard ML (Revised). 1997;MIT Press, Cambridge, MA.
20. Pierce B. Bounded quantification is undecidable. Inform. and Comput. 112:1994;131-165.
21. S.L. Peyton Jones, C. Hall, K. Hammond, W. Partain, P. Wadler, The Glasgow Haskell compiler: a technical overview, in: Proc. UK Joint Framework for Information Technology (JFIT) Technical Conf., 1993.
22. Pottinger G. A type assignment for the strongly normalizable. λ -terms Hindley J.R., Seldin J.P. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. 1980;561-577 Academic Press, New York.
23. Ronchi Della Rocca S. Principal type schemes and unification for intersection type discipline. Theoret. Comput. Sci. 59(1-2):1988;181-209.
24. Ronchi Della Rocca S., Venneri B. Principal type schemes for an extended type theory. Theoret. Comput. Sci. 28(1-2):1984;151-169.
25. Sallé P. Une extension de la théorie des types en. λ -calcul Ausiello G., Böhm C. Fifth Int. Conf. on Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 62:July 1978;398-410 Springer, Berlin.
26. É. Sayag, M. Mauny, A new presentation of the intersection type discipline through principal typings of normal forms, Technical Report RR-2998, INRIA, October 16, 1996.
27. É. Sayag, M. Mauny, Structural properties of intersection types, in: Proc. of the Eighth Int. Conf. on Logic and Computer Science - Theoretical Foundations of Computing (LIRA), Novi Sad, Yugoslavia, September 1997, pp. 167-175.
28. ω Math. Struct. Comput. Sci. 7(4):1997;329-358.
29. S.J. van Bakel, Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems, Ph.D. Thesis, Catholic University of Nijmegen, 1993.
30. J.B. Wells, Typability and type checking in the second-order λ -calculus are equivalent and undecidable, in: Proc. 9th Annu. IEEE Symp. Logic in Comput. Sci., 1994, pp. 176-185, superseded by [32].
31. J.B. Wells, Typability is undecidable for F+eta, Technical Report 96-022, Computer Science Department, Boston University, March 1996.
32. Wells J.B. Typability and type checking in System F are equivalent and undecidable. Ann. Pure Appl. Logic. 98(1-3):1999;111-156. supersedes [30].
33. J.B. Wells, The essence of principal typings, in: Proc. 29th Int. Coll. Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 913-925.