From ML to ML F: Graphic type constraints with efficient type inference

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2008, Pages 63-74

  Rémy, Didier ^a   Yakobowski, Boris ^a  

^a INRIA   (France)

Author keywords

Binders; Graphs; ML; ML F; System F; Type constraints; Type generalization; Type inference; Type instantiation; Types; Unification

Indexed keywords

GRAPHS; ML; ML F; SYSTEM F; TYPE CONSTRAINTS; TYPE GENERALIZATION; TYPE INFERENCE; TYPE INSTANTIATION; TYPES; UNIFICATION;

BINDERS; COMPUTER PROGRAMMING; FOURIER TRANSFORMS; FUNCTIONAL PROGRAMMING; INFORMATION THEORY; JAVA PROGRAMMING LANGUAGE; MAGNETIC LEAKAGE; PROGRAMMING THEORY;

INFERENCE ENGINES;

EID: 59249108701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411204.1411216     Document Type: Conference Paper

References (15)

1. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
2. Didier Le Botlan and Didier Rémy. MLF: Raising ML to the power of System-F. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 27-38, August 2003.
3. Didier Le Botlan and Didier Rémy. Recasting MLF. Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, June 2007.
4. Daan Leijen. A type directed translation of MLF to system F. In Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP'07), Freiburg, Germany, pages 111-122, October 2007.
5. Daan Leijen. Flexible types: robust type inference for first-class polymorphism. Technical Report MSR-TR-2008-55, Microsoft Research, March 2008.
6. Daan Leijen. HMF: Simple type inference for first-class polymorphism. In ICFP'08 15.
7. David McAllester. A logical algorithm for ML type inference. In International Conference on Rewriting Techniques and Applications (RTA), Valencia, Spain, volume 2706 of Lecture Notes in Computer-Science, pages 436-451. Springer-Verlag, June 2003.
8. François Pottier and Didier Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389-489. MIT Press, 2005.
9. Didier Rémy. Extending ML type system with a sorted equational theory. Research Report 1766, INRIA, 1992.
10. Didier Rémy and Boris Yakobowski. A graphical presentation of MLF types with a linear-time unification algorithm. In Proceedings of the 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI'07), pages 27-38, Nice, France, January 2007. ACM Press.
11. Didier Rémy and Boris Yakobowski. A Church-style intermediate language for MLF. Submitted, available at http://gallium.inria.fr/~remy/mlf 2008
12. Didier Rémy and Boris Yakobowski. A graphical presentation of MLF types with a linear-time incremental unification algorithm. Extended version, of 10, September 2008.
13. Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones. FPH: First-class polymorphism for Haskell. In ICFP'08 15.
14. Joe B. Wells. Typability and type checking in system F are equivalent and undecidable. Annals of Pure and Applied Logic, 98(1-3): 111-156, 1999.
15. Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP'08), Victoria, British Columbia, Canada. ACM Press, September 2008.