Practical type inference for arbitrary-rank types

Journal of Functional Programming

Volumn 17, Issue 1, 2007, Pages 1-82

  Jones, Simon Peyton ^a   Vytiniotis, Dimitrios ^b   Weirich, Stephanie ^b   Shields, Mark ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL LANGUAGES; IMPLEMENTATION LANGUAGES; INFERENCE ALGORITHM; POLYMORPHIC FUNCTIONS; SOURCE LANGUAGE; SYSTEM SUPPORTS; TYPE ANNOTATIONS; WRITE FUNCTIONS;

COMPUTABILITY AND DECIDABILITY;

INFERENCE ENGINES;

EID: 33846108693     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796806006034     Document Type: Article

References (44)

1. Baars, Arthur L, & Swierstra, S. Doaitse. (2002). Typing dynamic typing. Pages 157-166 of: ACM SIGPLAN International Conference on Functional Programming (ICFP'02), Pittsburgh: ACM.
2. Bird, Richard, & Paterson, Ross. (1999). De Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1), 77-91.
3. Cardelli, L. (1987). Basic polymorphic typechecking. Science of Computer Programming, 8(2), 147-172.
4. Clement, D, Despeyroux, J, Despeyroux, T, & Kahn, G. (1986). A simple applicative language: Mini-ML. Pages 13-27 of: ACM Symposium on Lisp and Functional Programming. ACM.
5. Damas, Luis, & Milner, Robin. (1982). Principal type-schemes for functional programs. Pages 207-12 of: Conference record of the 9th annual acm symposium on principles of programming languages. New York: ACM Press.
6. Garrigue, Jacques, & Remy, Didier. (1999). Semi-explicit first-class polymorphism for ML. Journal of information and computation, 155, 134-169.
7. Gill, A, Launchbury, J, & Peyton Jones, SL. (1993). A short cut to deforestation. Pages 223-232 of: ACM Conference on Functional Programming and Computer Architecture (FPCA'93). Cophenhagen: ACM Press. ISBN 0-89791-595-X.
8. Girard, J-Y. (1990). The system F of variable types: fifteen years later. Huet, G (ed), Logical foundations of functional programming, Addison-Wesley.
9. Hancock, P. (1987). A type checker. Pages 163-182 of: Peyton Jones, SL (ed), The implementation of functional programming languages. Prentice Hall.
10. Heeren, B, Hage, J, & Swierstra, SD. (2003). Scripting the type inference process. In: (ICFP03, 2003).
11. Hinze, Ralf. (2000). A new approach to generic functional programming. Pages 119-132 of: 27th ACM Symposium on Principles of Programming Languages (POPL'00), Boston: ACM.
12. Hinze, Ralf. (2001). Manufacturing datatypes. Journal of Functional Programming, 1.
13. Huet, G. (2002). Higher order unification 30 years later. 15th international workshop on higher order logic theorem proving and its applications (IWHOLTP'02). LNCS.
14. ICFP03. (2003). ACM SIGPLAN International Conference on Functional Programming (ICFP'03). Uppsala, Sweden: ACM.
15. ICFP05. (2005). ACM SIGPLAN International Conference on Functional Programming (ICFP'05). Tallinn, Estonia: ACM.
16. Jones, Mark. (1999). Typing Haskell in Haskell. Meijer, Erik (ed), Proceedings of the 1999 haskell workshop. Technical Reports, nos. UU-CS-1999-28. Available at ftp://ftp.cs. uu.nl/pub/RUU/CS/techreps/CS-1999/ 1999-28.pdf.
17. Kfoury, AJ, & Tiuryn, J. (1992). Type reconstruction in finite rank fragments of second-order lambda calculus. Information and Computation, 98(2), 228-257.
18. Kfoury, AJ, & Wells, JB. (1994). A direct algorithm for type inference in the rank-2 fragment of the second-order lambda calculus. Pages 196-207 of: ACM Symposium on Lisp and Functional Programming. Orlando, Florida: ACM.
19. Lämmel, Ralf, & Peyton Jones, Simon. (2003). Scrap your boilerplate: a practical approach to generic programming. Pages 26-37 of: ACM SIGPLAN International Workshop on Types in Language Design and Implementation (TLDI'03). New Orleans: ACM Press.
20. Launchbury, J, & Peyton Jones, SL. (1995). State in Haskell. Lisp and Symbolic Computation, 8(4), 293-342.
21. Le Botlan, D, & Rémy, D. (2003). MLF: raising ML to the power of System F. In: (ICFP03, 2003).
22. Lee, Oukseh, & Yi, Kwangkeun. (1998). Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4), 707-723.
23. Leijen, Daan, & Löh, Andres. (2005). Qualified types for MLF. In: (ICFP05, 2005).
24. Longo, Giuseppe, Milsted, Kathleen, & Soloviev, Sergei. (1995). A logic of subtyping (extended abstract). Pages 292-299 of: \lics95.
25. Miller, Dale. (1992). Unification under a mixed prefix. J. symb. comput., 14(4), 321-358.
26. Milner, R. (1978). A theory of type polymorphism in programming. Jess, 13(3).
27. Mitchell, John C. (1988). Polymorphic type inference and containment. Inf. comput., 76(2-3), 211-249.
28. Morrisett, G. 1995 (Dec.). Compiling with types. Ph.D. thesis, Carnegie Mellon University.
29. Odersky, M, & Läufer, K. (1996). Putting type annotations to work. Pages 54-67 of: 23rd ACM Symposium on Principles of Programming Languages (POPL'96). St Petersburg Beach, Florida: ACM.
30. Odersky, Martin, Zenger, Matthias, & Zenger, Christoph. (2001). Colored local type inference. 28th ACM Symposium on Principles of Programming Languages (POPL'01). London: ACM.
31. Okasaki, C. (1999). From fast exponentiation to square matrices: an adventure in types. Pages 28-35 of: ACM SIGPLAN International Conference on Functional Programming (ICFP'99). Paris: ACM.
32. Peyton Jones, Simon. (2001). Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. Pages 47-96 of: Hoare, CAR, Broy, M, & Steinbrueggen, R (eds), Engineering theories of software construction, Marktoberdorf Summer School 2000. NATO ASI Series. IOS Press.
33. Peyton Jones, SL, & Santos, A. (1998). A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3), 3-47.
34. Pierce, Benjamin. (2002). Types and programming languages. MIT Press.
35. Pierce, Benjamin C., & Turner, David N. (1998). Local type inference. Pages 252-265 of: 25th ACM Symposium on Principles of Programming Languages (POPL'98). San Diego: ACM.
36. Pettier, F, & Rmy, D. (2004). ML. Pierce, BC (ed), Advanced topics in types and programming languages. MIT Press.
37. Rémy, Didier. (2005). Simple, partial type inference for System F, based on type containment. In: (ICFP05, 2005).
38. Shao, Zhong. 1997 (June). An overview of the FLINT/ML compiler. Proc, 1997 ACM SIGPLAN workshop on types in compilation (TIC'97).
39. Shields, Mark, & Peyton Jones, Simon. (2002). Lexically scoped type variables. Microsoft Research.
40. Tarditi, D, Morrisett, G, Cheng, P, Stone, C, Harper, R, & Lee, P. (1996). TIL: A type-directed optimizing compiler for ML. Pages 181-192 of: ACM Conference on Programming Languages Design and Implementation (PLDI'96). Philadelphia: ACM.
41. Tiuryn, J, & Urzyczyn, P. (1996). The subtyping problem for second order types is undecidable. Proc. IEEE Symposium on Logic in Computer Science (LICS'96).
42. Tiuryn, Jerzy. (2001). A sequent calculus for subtyping polymorphic types. Inf. comput., 164(2), 345-369.
43. Vytiniotis, Dimitrios, Weirich, Stephanie, & Peyton Jones, Simon. 2005 (July). Practical type inference for arbitrary-rank types, Technical Appendix. Tech. rept. MS-CIS-05-14. University of Pennsylvania.
44. Wells, JB. (1999). Typability and type checking in system F are equivalent and undecidable. Ann. Pure Appl. Logic, 98, 111-156.