Flexible types: Robust type inference for first-class polymorphism

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 66-77

  Leijen, Daan ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

First class polymorphism; MLF; System F

Indexed keywords

FIRST-CLASS POLYMORPHISM; FUNCTION PARAMETERS; MLF; POLYMORPHIC TYPES; PROGRAM TRANSFORMATIONS; REFERENCE IMPLEMENTATION; SYSTEM F; TYPE INFERENCE ALGORITHM; TYPE INFERENCES;

MAGNETIC LEAKAGE; POLYMORPHISM;

INFERENCE ENGINES;

EID: 67649884991     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480891     Document Type: Conference Paper

References (23)

1. H. Curry and R. Feys. Combinatory Logic, volume 1. North- Holland, 1958.
2. Luis Damas. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, April 1985. Technical report CST-33-85.
3. Luis Damas and Robin Milner. Principal type-schemes for functional programs. In 9th ACM symp. on Principles of Programming Languages (POPL'82), pages 207-212, 1982.
4. Atze Dijkstra. Stepping through Haskell. PhD thesis, Universiteit Utrecht, Nov. 2005.
5. Jacques Garrigue and Didier Ŕemy. Semi-explicit first-class polymorphism for ML. Journal of Information and Computation, 155:134-169, 1999. (Pubitemid 129610456)
6. J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, Dec. 1969.
7. Mark P. Jones. First-class polymorphism with type inference. In 24th ACM Symposium on Principles of Programming Languages (POPL'97), January 1997.
8. George Kuan and David MacQueen. Efficient ML type inference using ranked type variables. In The 2007 ACM SIGPLAN Workshop on ML (ML 2007), Freiburg, Germany, October 2007.
9. F: Une extension de ML avec polymorphisme de second ordre et instanciation implicite. PhD thesis, INRIA Rocquencourt, May 2004. Also in English.
10. Didier Le Botlan and Didier Rémy. MLF: Raising ML to the power of System-F. In The International Conference on Functional Programming (ICFP'03), pages 27-38, aug 2003.
11. Didier Le Botlan and Didier Rémy. Recasting MLF. Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, June 2007.
12. Daan Leijen. HMF: Simple type inference for first-class polymorphism. In 13th ACM symp. of the International Conference on Functional Programming (ICFP'08), September 2008a. Extended version available as a technical report: MSR-TR-2007-2118, Sep 2007, Microsoft Research.
13. Daan Leijen. A reference implementation of HML. Available at http://research.microsoft.com/users/daan/pubs. html, April 2008b.
14. Daan Leijen. A type directed translation from MLF to System F. In The International Conference on Functional Programming (ICFP'07), Oct. 2007.
15. Daan Leijen and Andres Löh. Qualified types for MLF. In The International Conference on Functional Programming (ICFP'05). ACM Press, Sep. 2005.
16. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:248-375, 1978. (Pubitemid 9432714)
17. Martin Odersky and Konstantin Läufer. Putting type annotations to work. In 23th ACM symp. on Principles of Programming Languages (POPL'96), pages 54-67, January 1996.
18. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Mark Shields. Practical type inference for arbitrary-rank types. Journal of Functional Programming, 17(1):1-82, 2007.
19. Didier Rémy. Simple, partial type-inference for System-F based on type-containment. In The International Conference on Functional Programming (ICFP'05), September 2005.
20. Didier Rémy and Boris Yakobowski. A graphical presentation of MLF types with a linear-time unification algorithm. In TLDI'07, pages 27-38, 2007. (Pubitemid 47338829)
21. Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones. Boxy types: type inference for higher-rank types and impredicativity. In The International Conference on Functional Programming (ICFP'06), September 2006.
22. Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones. FPH : First-class polymorphism for Haskell. In 13th ACM symp. of the International Conference on Functional Programming (ICFP'08), September 2008.
23. J.B.Wells. Typability and type checking in System-F are equivalent and undecidable. Ann. Pure Appl. Logic, 98(1-3):111-156, 1999.