Didier Rémy

1.4k total citations
23 papers, 398 citations indexed

About

Didier Rémy is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Didier Rémy has authored 23 papers receiving a total of 398 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 6 papers in Hardware and Architecture. Recurrent topics in Didier Rémy's work include Logic, programming, and type systems (21 papers), Natural Language Processing Techniques (8 papers) and Parallel Computing and Optimization Techniques (6 papers). Didier Rémy is often cited by papers focused on Logic, programming, and type systems (21 papers), Natural Language Processing Techniques (8 papers) and Parallel Computing and Optimization Techniques (6 papers). Didier Rémy collaborates with scholars based in France, United Kingdom and United States. Didier Rémy's co-authors include Didier Le Botlan, Jérôme Vouillon, Jon G. Riecke, Carl A. Gunter, Benjamin C. Pierce, M. Abadi, Luca Cardelli, Jacques Garrigue, Thomas J. Williams and Cosimo Laneve and has published in prestigious journals such as ACM SIGPLAN Notices, Information and Computation and Journal of Functional Programming.

In The Last Decade

Didier Rémy

22 papers receiving 352 citations

Peers

Didier Rémy
Mark Shields United States
David Stoutamire United States
Huu Hai Nguyen Singapore
Dominic Duggan United States
Mark Shields United States
Didier Rémy
Citations per year, relative to Didier Rémy Didier Rémy (= 1×) peers Mark Shields

Countries citing papers authored by Didier Rémy

Since Specialization
Citations

This map shows the geographic impact of Didier Rémy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Didier Rémy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Didier Rémy more than expected).

Fields of papers citing papers by Didier Rémy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Didier Rémy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Didier Rémy. The network helps show where Didier Rémy may publish in the future.

Co-authorship network of co-authors of Didier Rémy

This figure shows the co-authorship network connecting the top 25 collaborators of Didier Rémy. A scholar is included among the top collaborators of Didier Rémy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Didier Rémy. Didier Rémy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Rémy, Didier, et al.. (2024). Fulfilling OCaml Modules with Transparency. Proceedings of the ACM on Programming Languages. 8(OOPSLA1). 194–222. 1 indexed citations
2.
Williams, Thomas J. & Didier Rémy. (2017). A principled approach to ornamentation in ML. Proceedings of the ACM on Programming Languages. 2(POPL). 1–30. 5 indexed citations
3.
Rémy, Didier, et al.. (2015). Which simple types have a unique inhabitant?. ACM SIGPLAN Notices. 50(9). 243–255. 2 indexed citations
4.
Rémy, Didier, et al.. (2011). Extending System F with Abstraction over Erasable Coercions. 45.
5.
Botlan, Didier Le & Didier Rémy. (2009). Recasting MLF. Information and Computation. 207(6). 726–785. 11 indexed citations
6.
Rémy, Didier, et al.. (2009). Modeling abstract types in modules with open existential types. ACM SIGPLAN Notices. 44(1). 354–365. 1 indexed citations
7.
Rémy, Didier, et al.. (2009). Modeling abstract types in modules with open existential types. SPIRE - Sciences Po Institutional REpository. 354–365. 12 indexed citations
8.
Rémy, Didier, et al.. (2008). From ML to ML F. ACM SIGPLAN Notices. 43(9). 63–74. 6 indexed citations
9.
Rémy, Didier, et al.. (2007). A graphical presentation of ML F types with a linear-time unification algorithm. 27–38. 12 indexed citations
10.
Rémy, Didier. (2005). Simple, partial type-inference for System F based on type-containment. 130–143. 22 indexed citations
11.
Botlan, Didier Le & Didier Rémy. (2003). ML F. 27–38. 42 indexed citations
12.
Fournet, Cédric, Cosimo Laneve, Luc Maranget, & Didier Rémy. (2003). Inheritance in the join calculus. The Journal of Logic and Algebraic Programming. 57(1-2). 23–69. 8 indexed citations
13.
Botlan, Didier Le & Didier Rémy. (2003). ML F. ACM SIGPLAN Notices. 38(9). 27–38. 6 indexed citations
14.
Rémy, Didier, et al.. (2000). Using, Understanding, and Unraveling - The Ocaml Language - From Practice to Theory and vice versa. 2 indexed citations
15.
Garrigue, Jacques & Didier Rémy. (1999). Semi-Explicit First-Class Polymorphism for ML. Information and Computation. 155(1-2). 134–169. 32 indexed citations
16.
Rémy, Didier & Jérôme Vouillon. (1997). Objective ML. 40–53. 56 indexed citations
17.
Abadi, M., Luca Cardelli, Benjamin C. Pierce, & Didier Rémy. (1995). Dynamic typing in polymorphic languages. Journal of Functional Programming. 5(1). 111–130. 76 indexed citations
18.
Gunter, Carl A., Didier Rémy, & Jon G. Riecke. (1995). A generalization of exceptions and control in ML-like languages. 12–23. 75 indexed citations
19.
Pierce, Benjamin C., Didier Rémy, & David N. Turner. (1993). A Typed Higher-Order Programming Language Based on the Pi-Calculus. Kyoto University Research Information Repository (Kyoto University). 851. 46–60. 4 indexed citations
20.
Rémy, Didier. (1992). Projective ML. 66–75. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026