Travelled to:
1 × Austria
1 × Estonia
1 × France
1 × Italy
1 × Portugal
1 × Sweden
1 × United Kingdom
2 × Canada
2 × Japan
6 × USA
Collaborated with:
∅ G.Scherer J.Cretin B.Yakobowski B.Montagu D.L.Botlan J.Vouillon Thomas Williams R.D.Cosmo F.Pottier C.A.Gunter J.G.Riecke
Talks about:
ml (10) type (9) sup (4) system (3) subtyp (3) object (3) simpl (3) constraint (2) ornament (2) coercion (2)
Person: Didier Rémy
DBLP: R=eacute=my:Didier
Contributed to:
Wrote 19 papers:
- ESOP-2015-SchererR #reduction
- Full Reduction in the Face of Absurdity (GS, DR), pp. 685–709.
- ICFP-2015-SchererR #question
- Which simple types have a unique inhabitant? (GS, DR), pp. 243–255.
- LICS-CSL-2014-CretinR #constraints #system f
- System F with coercion constraints (JC, DR), p. 10.
- ESOP-2013-SchererR #data type #type system
- GADTs Meet Subtyping (GS, DR), pp. 554–573.
- POPL-2012-CretinR #abstraction #on the #power of
- On the power of coercion abstraction (JC, DR), pp. 361–372.
- FLOPS-2010-RemyY
- A Church-Style Intermediate Language for MLF (DR, BY), pp. 24–39.
- POPL-2009-MontaguR #data type #modelling
- Modeling abstract types in modules with open existential types (BM, DR), pp. 354–365.
- ICFP-2008-RemyY #constraints #ml #performance #type inference
- From ML to MLF: graphic type constraints with efficient type inference (DR, BY), pp. 63–74.
- ICFP-2005-Remy #system f
- Simple, partial type-inference for System F based on type-containment (DR), pp. 130–143.
- TLCA-2005-CosmoPR #commutative #recursion #type system
- Subtyping Recursive Types Modulo Associative Commutative Products (RDC, FP, DR), pp. 179–193.
- ICFP-2003-BotlanR #ml #named #power of #system f
- MLF: raising ML to the power of system F (DLB, DR), pp. 27–38.
- ESOP-1998-Remy #type system
- From Classes to Objects via Subtyping (DR), pp. 200–220.
- POPL-1997-RemyV #ml #object-oriented
- Objective ML: A Simple Object-Oriented Extension of ML (DR, JV), pp. 40–53.
- FPCA-1995-GunterRR #exception
- A Generalization of Exceptions and Control in ML-like Languages (CAG, DR, JGR), pp. 12–23.
- LFP-1992-Remy #ml
- Projective ML (DR), pp. 66–75.
- POPL-1992-Remy #for free #type system
- Typing Record Concatenation for Free (DR), pp. 166–176.
- POPL-1989-Remy #ml
- Typechecking Records and Variants in a Natural Extension of ML (DR), pp. 77–88.
- Haskell-2017-Remy #automation #named #parametricity #reuse
- Ornaments: exploiting parametricity for safer, more automated code refactorization and code reuse (invited talk) (DR), p. 1.
- POPL-2018-WilliamsR #approach #ml
- A principled approach to ornamentation in ML (TW, DR), p. 30.