Practical type inference for arbitrary-rank types (2005)

by Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton-jones
Venue:Journal of Functional Programming
Citations:78 - 18 self

Documents Related by Co-Citation

129 Simple unification-based type inference for GADTs – Simon Peyton Jones - 2006
323 Principal type-schemes for functional programs – Luis Damas, Robin Milner - 1982
874 A theory of type polymorphism in programming – Robin Milner - 1978
91 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
29 Boxy types: inference for higher-rank types and impredicativity – D Vytiniotis, S Weirich, S Peyton Jones - 2006
171 A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism – Mark P. Jones - 1995
70 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
150 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
573 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David MacQueen - 1997
98 The principal type scheme of an object in combinatory logic – J R Hindley - 1969
62 A Polymorphic Type System for Extensible Records and Variants – Benedict R. Gaster, Mark P. Jones - 1996
9 Raising ML to the Power of System F – Didier Le Botlan, Didier Remy - 2003
213 Monad Transformers and Modular Interpreters – Sheng Liang, Paul Hudak, Mark Jones - 1995
1224 Introduction to functional programming – Philip Wadler - 1995
44 The essence of ML type inference – François Pottier, Didier Rémy - 2005
580 Types and Programming Languages – B C Pierce - 2002
138 Type classes with functional dependencies – Mark P. Jones - 2000
315 How to Make Ad-Hoc Polymorphism Less Ad Hoc – Philip Wadler, Stephen Blott - 1988
18 Semi-Explicit First-Class Polymorphism for ML – Jacques Garrigue, Didier Rémy - 1999