Efficient type inference using ranked type variables

ML'07: Proceedings of the 2007 Workshop on ML

Volumn , Issue , 2007, Pages 3-14

  Kuan, George ^a   MacQueen, David ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Algorithm W; Compilers; Functional programming; Standard ML; Type checking; Type inference

Indexed keywords

TYPE CHECKING; TYPE INFERENCE;

ABSTRACTING; FUNCTIONAL PROGRAMMING; MARKUP LANGUAGES; PROGRAM COMPILERS; SEMANTICS;

ALGORITHMS;

EID: 38849166539     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1292535.1292538     Document Type: Conference Paper

References (18)

1. Luís Damas, unpublished note, 1984.
2. Matthias Felleisen and Robert Hieb. A revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103 (2): 23 5-271, 1992.
3. Jacques Garrigue. Relaxing the value restriction. Functional and Logic Programming, 2004.
4. George Kuan, David MacQueen, and Robert Bruce Findler. A rewriting semantics for type inference. In Rocco De Nicola, editor, Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, volume 4421, March 2007.
5. Oukseh Lee and Kwangkeun Yi. Proofs about a folklore letpolymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707-723, July 1998.
6. Xavier Leroy. Polymorphism by name for references and continuations. In POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 220-231, New York, NY, USA, 1993. ACM Press.
7. Xavier Leroy and Pierre Weis. Polymorphic type inference and assignment. In POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACTsymposium on Principles of programming languages, pages 291-302, New York, NY, USA, 1991. ACM Press.
8. Harry G. Mairson. Deciding ml typability is complete for deterministic exponential time. In POPL, pages 382-401, 1990.
9. Robin Milner. A theory of type polymorphism in programming. JCSS, 17:348-375, 1978.
10. Benjamin C. Pierce and David N. Turner. Local type inference. In POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 252-265, New York, NY, USA, 1998. ACM Press.
11. François Pottier. A semi-syntactic soundness proof for HM(X). Technical Report RR-4150, INRIA, 2001.
12. 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.
13. Didier Rémy. Extending ML type system with a sorted equational theory. Research Report 1766, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1992.
14. John C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM '72: Proceedings of the ACM annual conference, pages 717-740, New York, NY, USA, 1972. ACM Press.
15. Christian Skalka and François Pottier. Syntactic type soundness for HM(X). In Proceedings of the Workshop on Types in Programming (TIP'02), volume 75 of Electronic Notes in Theoretical Computer Science, Dagstuhl, Germany, July 2002.
16. Geoffrey Smith and Dennis Volpano. Polymorphic typing of variables and references. ACM Trans. Program. Lang. Syst., 18(3):254-267, 1996.
17. Mads Tofte. Type inference for polymorphic references. Inf. Comput., 89(l):1-34, 1990.
18. Andrew K. Wright. Simple imperative polymorphism. Lisp Symb. Comput., 8(4):343-355, 1995.