A graphical presentation of MLF types with a linear-time unification algorithm

Proceedings of the TLDI 2007: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation - Papers Presented at the Workshop

Volumn , Issue , 2007, Pages 27-38

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

^a INRIA ROCQUENCOURT   (France)

Author keywords

Binders; Graphs; MLF; System SF; Types; Unification

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); GRAPH THEORY; TREES (MATHEMATICS);

BINDING STRUCTURE; BINDING TREE ENCODING; DAG REPRESENTATION; LINEAR-TIME UNIFICATION ALGORITHM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34548297896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190315.1190321     Document Type: Conference Paper

References (12)

1. Richard Cole and Ramesh Hariharan. Dynamic LCA queries on trees. In SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pages 235-244, Philadelphia, PA, USA, 1999. Society for Industrial and Applied Mathematics.
2. Luis Damas and Robin Milner. Principal type-schemes for functional programs. In Proceedings of the Ninth ACM Conference on Principles of Programming Langages, pages 207-212, 1982.
3. Nadji Gauthier and François Pottier. Numbering matters: First-order canonical forms for second-order recursive types. In Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming (ICFP'04), pages 150-161, September 2004.
4. Jean-Yves Girard. Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur. Thèse d'état, University of Paris VII, 1972.
5. Gérard Huet. Résolution d'équations dans les langages d'ordre 1,2,..., w). Thèse de doctorat d'état, Université Paris 7, 1976.
6. Didier Le Botlan. MLF: Une extension de ML avec polymorphisme de second or-r-e et instanciation implicite. PhD thesis, University of Paris 7, June 2004. (english version).
7. 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.
8. Didier Le Botlan and Didier Rémy. MLF made simple. Draft, available electronically at http//gallium.inria.fr/~remy/project/mlf, 2006
9. Daan Leijen and Andres Löh. Qualified types for MLF. In ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, pages 144-155, New York, NY, USA, September 2005. ACM Press.
10. Alberto Martelli and Ugo Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258-282, 1982.
11. Michael S. Paterson and Mark N. Wegman. Linear unification. Journal of Computer and System, 16(2): 158-167, 1978.
12. F types with a linear-time incremental unification algorithm. Extended version, available at http://gallium.inria.fr/~remy/project/mlf September 2006.