QML: Explicit first-class polymorphism for ML

ML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML

Volumn , Issue , 2009, Pages 3-14

  Russo, Claudio V ^a   Vytiniotis, Dimitrios ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Impredicativity; Polymorphism; Type inference

Indexed keywords

BOUND VARIABLES; EXISTENTIAL QUANTIFIERS; SYSTEM F; TYPE INFERENCES;

LINGUISTICS; MAGNETIC LENSES;

POLYMORPHISM;

EID: 70450274931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. B. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, and S. Weirich. Engineering formal metatheory. In POPL'08, pages 3-15, ACM, 2008.
2. The Coq proof assistant. http://coq.inria.fr.
3. L. Damas and R. Milner. Principal type-schemes for functional programs. In POPL'82, pages 207-12, ACM, 1982.
4. J. Garrigue and D. Rémy. Semi-explicit first-class polymorphism for ML. Journal of Information and Computation, 155:134-169, 1999.
5. J. R. Hindley. The principal type-scheme of an object in combinatory logic. (146):29-60, 1969.
6. M. P. Jones. First-class polymorphism with type inference. In POPL'97, pages 483-496, ACM, 1997.
7. 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 ACM Symposium on Lisp and Functional Programming, pages 196-207. ACM, Orlando, Florida, June 1994.
8. N. R. Krishnaswami. Focusing on pattern matching. In POPL '09, pages 366-378, ACM, 2009.
9. D. Le Botlan and D. Rémy. MLF: raising ML to the power of System F. In ICFP'03, pages 27-38, ACM, 2003.
10. D. Leijen. HMF: simple type inference for first-class polymorphism. In ICFP'08. ACM, 2008.
11. D. Leijen. Flexible types: robust type inference for first-class polymorphism. In POPL '09, pages 66-77, ACM, 2009.
12. K. Läufer and M. Odersky. Polymorphic type inference and abstract data types. ACM Transactions on Programming Languages and Systems, 16(5):1411-1430, 1994.
13. D. Miller. Unification under a mixed prefix. J. Symb. Comput., 14(4):321-358, 1992.
14. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
15. M. Odersky and K. Läufer. Putting type annotations to work. In POPL'96, pages 54-67, ACM, 1996.
16. J. O'Toole and D. Gifford. Type reconstruction with first-class polymorphic values. In PLDI'89, pages 207-217, 1989. Published as SIG-PLAN Notices, volume 27, number 7.
17. L. Paulson. ML for the working programmer. Cambridge University Press, 1991.
18. S. Peyton Jones, D. Vytiniotis, S. Weirich, and M. Shields. Practical type inference for arbitrary-rank types. J. Funct. Program., 17(1):1-82, 2007.
19. F. Pfenning. Partial polymorphic type inference and higher-order unification. In LFP '88, pages 153-163, ACM, 1988.
20. D. Rémy. Programming objects with ML-ART: An extension to ML with abstract and record types. In M. Hagiya and J. C. Mitchell, editors, International Symposium on Theoretical Aspects of Computer Software, number 789 in LNCS, pages 321-346, Springer, 1994.
21. D. Rémy. Simple, partial type inference for System F, based on type containment. In ICFP'05, pages 130-143, ACM, 2005.
22. C. V. Russo. First-class Structures for Standard ML. Nordic Journal Of Computing, 7:348-374, January 2000.
23. D. Vytiniotis, S. Weirich, and S. Peyton Jones. Boxy types: Inference for higher-rank types and impredicativity. In ICFP'06, ACM, 2006.
24. D. Vytiniotis, S. Weirich, and S. Peyton Jones. FPH: first-class polymorphism for Haskell. In ICFP'08, ACM, 2008.
25. J. B. Wells. Typability and type checking in system F are equivalent and undecidable. Ann. Pure Appl. Logic, 98:111-156, 1999.