default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDidier Rémy
Person information
- affiliation: INRIA Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Clement Blaudeau
, Didier Rémy, Gabriel Radanne:
Fulfilling OCaml Modules with Transparency. Proc. ACM Program. Lang. 8(OOPSLA1): 194-222 (2024)
2010 – 2019
- 2018
- [j9]Thomas Williams, Didier Rémy:
A principled approach to ornamentation in ML. Proc. ACM Program. Lang. 2(POPL): 21:1-21:30 (2018) - 2017
- [c30]Didier Rémy:
Ornaments: exploiting parametricity for safer, more automated code refactorization and code reuse (invited talk). Haskell 2017: 1 - 2015
- [c29]Gabriel Scherer, Didier Rémy:
Full Reduction in the Face of Absurdity. ESOP 2015: 685-709 - [c28]Gabriel Scherer, Didier Rémy:
Which simple types have a unique inhabitant? ICFP 2015: 243-255 - 2014
- [j8]Didier Le Botlan, Didier Rémy:
MLF: raising ML to the power of system F. ACM SIGPLAN Notices 49(4S): 52-63 (2014) - [c27]Julien Cretin, Didier Rémy:
System F with coercion constraints. CSL-LICS 2014: 34:1-34:10 - [c26]Thomas Williams, Pierre-Évariste Dagand, Didier Rémy:
Ornaments in practice. WGP@ICFP 2014: 15-24 - 2013
- [c25]Jacques Garrigue, Didier Rémy:
Ambivalent Types for Principal Type Inference with GADTs. APLAS 2013: 257-272 - [c24]Gabriel Scherer, Didier Rémy:
GADTs Meet Subtyping. ESOP 2013: 554-573 - [i2]Gabriel Scherer, Didier Rémy:
GADTs meet subtyping. CoRR abs/1301.2903 (2013) - 2012
- [j7]Didier Rémy, Boris Yakobowski:
A church-style intermediate language for MLF. Theor. Comput. Sci. 435: 77-105 (2012) - [c23]Julien Cretin, Didier Rémy:
On the power of coercion abstraction. POPL 2012: 361-372 - [i1]Gabriel Scherer, Didier Rémy:
GADT meet Subtyping. CoRR abs/1210.5935 (2012) - 2010
- [c22]Didier Rémy, Boris Yakobowski:
A Church-Style Intermediate Language for MLF. FLOPS 2010: 24-39
2000 – 2009
- 2009
- [j6]Didier Le Botlan, Didier Rémy:
Recasting MLF. Inf. Comput. 207(6): 726-785 (2009) - [c21]Benoît Montagu, Didier Rémy:
Modeling abstract types in modules with open existential types. POPL 2009: 354-365 - 2008
- [c20]Didier Rémy, Boris Yakobowski:
From ML to MLF: graphic type constraints with efficient type inference. ICFP 2008: 63-74 - 2007
- [c19]Didier Rémy:
MLF for everyone (users, implementers, and designers). ML 2007: 1-2 - [c18]Didier Rémy, Boris Yakobowski:
A graphical presentation of MLF types with a linear-time unification algorithm. TLDI 2007: 27-38 - 2005
- [c17]Didier Rémy:
Simple, partial type-inference for System F based on type-containment. ICFP 2005: 130-143 - [c16]Roberto Di Cosmo, François Pottier, Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products. TLCA 2005: 179-193 - 2003
- [j5]Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy:
Inheritance in the join calculus. J. Log. Algebraic Methods Program. 57(1-2): 23-69 (2003) - [c15]Didier Le Botlan, Didier Rémy:
MLF: raising ML to the power of system F. ICFP 2003: 27-38 - 2002
- [j4]Kim B. Bruce, Didier Rémy:
Guest Editorial: Foundations of Object-Oriented Languages. Inf. Comput. 172(1): 1 (2002) - 2000
- [c14]Didier Rémy:
Using, Understanding, and Unraveling the OCaml Language. From Practice to Theory and Vice Versa. APPSEM 2000: 413-536 - [c13]Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy:
Inheritance in the Join Calculus. FSTTCS 2000: 397-408
1990 – 1999
- 1999
- [j3]Jacques Garrigue, Didier Rémy:
Semi-Explicit First-Class Polymorphism for ML. Inf. Comput. 155(1-2): 134-169 (1999) - [c12]Franck Delaplace, Didier Rémy:
PARADEIS: An Object Library for Parallel Sparse Array Computation. ACPC 1999: 153-162 - [e1]Didier Rémy, Peter Lee:
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, September 27-29, 1999. ACM 1999, ISBN 1-58113-111-9 [contents] - 1998
- [j2]Didier Rémy, Jerome Vouillon:
Objective ML: An Effective Object-Oriented Extension to ML. Theory Pract. Object Syst. 4(1): 27-50 (1998) - [c11]Didier Rémy:
From Classes to Objects via Subtyping. ESOP 1998: 200-220 - 1997
- [c10]Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy:
Implicit Typing à la ML for the Join-Calculus. CONCUR 1997: 196-212 - [c9]Didier Rémy, Jerome Vouillon:
Objective ML: A Simple Object-Oriented Extension of ML. POPL 1997: 40-53 - [c8]Jacques Garrigue, Didier Rémy:
Extending ML with Semi-Explicit Higher-Order Polymorphism. TACS 1997: 20-46 - 1996
- [c7]Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy:
A Calculus of Mobile Agents. CONCUR 1996: 406-421 - [c6]Didier Rémy:
Synthèse de types dans les langages à objets. LMO 1996: 228-230 - 1995
- [j1]Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Didier Rémy:
Dynamic Typing in Polymorphic Languages. J. Funct. Program. 5(1): 111-130 (1995) - [c5]Carl A. Gunter, Didier Rémy, Jon G. Riecke:
A Generalization of Exceptions and Control in ML-like Languages. FPCA 1995: 12-23 - 1994
- [c4]Didier Rémy:
Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types. TACS 1994: 321-346 - 1992
- [c3]Didier Rémy:
Projective ML. LISP and Functional Programming 1992: 66-75 - [c2]Didier Rémy:
Typing Record Concatenation for Free. POPL 1992: 166-176
1980 – 1989
- 1989
- [c1]Didier Rémy:
Typechecking Records and Variants in a Natural Extension of ML. POPL 1989: 77-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
