ML^F - Raising ML to the Power of System F (2003)

by Didier Le Botlan , Didier Rémy
Venue:In ICFP ’03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Citations:12 - 0 self

Documents Related by Co-Citation

702 Types and programming languages – Benjamin C Pierce - 2002
58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
939 A theory of type polymorphism in programming – Robin Milner - 1978
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
357 Principal type-schemes for functional programs. Pages 207–212 of – Luis Damas, Robin Milner - 1982
363 Towards a theory of type structure – J C Reynolds - 1974
91 Practical type inference for arbitrary-rank types – Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-jones - 2005
103 Polymorphic type inference and containment – J C Mitchell - 1984
14 HMF: Simple type inference for first-class polymorphism – Daan Leijen - 2008
61 Polymorphic Type Inference and Abstract Data Types – Konstantin Läufer, Martin Odersky - 1994
326 Theorems for free! – Philip Wadler - 1989
47 First-class Polymorphism with Type Inference – Mark P. Jones
124 Unification under a mixed prefix – Dale Miller - 1992
20 Semi-Explicit First-Class Polymorphism for ML – Jacques Garrigue, Didier Rémy - 1999
56 Colored Local Type Inference – Martin Odersky, Matthias Zenger, Matthias Zenger - 2001
56 The essence of ML type inference – F Pottier, D Rémy - 2005
68 De Bruijn notation as a nested datatype – Richard S. Bird, Ross Paterson, Sir Arthur, Conan Doyle - 1999