| 2009 |
| 26 | EE | Benoît Montagu,
Didier Rémy:
Modeling abstract types in modules with open existential types.
POPL 2009: 354-365 |
| 2008 |
| 25 | EE | Didier Rémy,
Boris Yakobowski:
From ML to MLF: graphic type constraints with efficient type inference.
ICFP 2008: 63-74 |
| 2007 |
| 24 | EE | Didier Rémy:
MLF for everyone (users, implementers, and designers).
ML 2007: 1-2 |
| 23 | EE | Didier Rémy,
Boris Yakobowski:
A graphical presentation of MLF types with a linear-time unification algorithm.
TLDI 2007: 27-38 |
| 2005 |
| 22 | EE | Didier Rémy:
Simple, partial type-inference for System F based on type-containment.
ICFP 2005: 130-143 |
| 21 | EE | Roberto Di Cosmo,
François Pottier,
Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products.
TLCA 2005: 179-193 |
| 2003 |
| 20 | EE | Didier Le Botlan,
Didier Rémy:
MLF: raising ML to the power of system F.
ICFP 2003: 27-38 |
| 19 | EE | Cédric Fournet,
Cosimo Laneve,
Luc Maranget,
Didier Rémy:
Inheritance in the join calculus.
J. Log. Algebr. Program. 57(1-2): 23-69 (2003) |
| 2002 |
| 18 | EE | Kim B. Bruce,
Didier Rémy:
Guest Editorial: Foundations of Object-Oriented Languages.
Inf. Comput. 172(1): 1 (2002) |
| 2000 |
| 17 | EE | Didier Rémy:
Using, Understanding, and Unraveling the OCaml Language. From Practice to Theory and Vice Versa.
APPSEM 2000: 413-536 |
| 16 | EE | Cédric Fournet,
Cosimo Laneve,
Luc Maranget,
Didier Rémy:
Inheritance in the Join Calculus.
FSTTCS 2000: 397-408 |
| 1999 |
| 15 | EE | Franck Delaplace,
Didier Rémy:
PARADEIS: An Object Library for Parallel Sparse Array Computation.
ACPC 1999: 153-162 |
| 14 | | Jacques Garrigue,
Didier Rémy:
Semi-Explicit First-Class Polymorphism for ML.
Inf. Comput. 155(1-2): 134-169 (1999) |
| 1998 |
| 13 | EE | Didier Rémy:
From Classes to Objects via Subtyping.
ESOP 1998: 200-220 |
| 12 | | Didier Rémy,
Jerome Vouillon:
Objective ML: An Effective Object-Oriented Extension to ML.
TAPOS 4(1): 27-50 (1998) |
| 1997 |
| 11 | | Cédric Fournet,
Cosimo Laneve,
Luc Maranget,
Didier Rémy:
Implicit Typing à la ML for the Join-Calculus.
CONCUR 1997: 196-212 |
| 10 | EE | Didier Rémy,
Jerome Vouillon:
Objective ML: A Simple Object-Oriented Extension of ML.
POPL 1997: 40-53 |
| 9 | | Jacques Garrigue,
Didier Rémy:
Extending ML with Semi-Explicit Higher-Order Polymorphism.
TACS 1997: 20-46 |
| 1996 |
| 8 | | Cédric Fournet,
Georges Gonthier,
Jean-Jacques Lévy,
Luc Maranget,
Didier Rémy:
A Calculus of Mobile Agents.
CONCUR 1996: 406-421 |
| 7 | | Didier Rémy:
Synthèse de types dans les langages à objets.
LMO 1996: 228-230 |
| 1995 |
| 6 | | Carl A. Gunter,
Didier Rémy,
Jon G. Riecke:
A Generalization of Exceptions and Control in ML-like Languages.
FPCA 1995: 12-23 |
| 5 | | Martín Abadi,
Luca Cardelli,
Benjamin C. Pierce,
Didier Rémy:
Dynamic Typing in Polymorphic Languages.
J. Funct. Program. 5(1): 111-130 (1995) |
| 1994 |
| 4 | | Didier Rémy:
Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types.
TACS 1994: 321-346 |
| 1992 |
| 3 | EE | Didier Rémy:
Projective ML.
LISP and Functional Programming 1992: 66-75 |
| 2 | | Didier Rémy:
Typing Record Concatenation for Free.
POPL 1992: 166-176 |
| 1989 |
| 1 | | Didier Rémy:
Typechecking Records and Variants in a Natural Extension of ML.
POPL 1989: 77-88 |