Didier RÉMY
56, rue de la Tombe Issoire
F-75 014 Paris
Email: Didier.Remy@inria.fr
Phone: 33-1-4335 3773
Mobile: 33-6-5168 6796
Born on April 8th, 1963. French citizen.
Curriculum Vitæ
Rocquencourt, October 2015

Current position

Interests

Design and formalization of programming languages.
In particular:

Education

Research experience

2014 - now
Senior research scientist at INRIA in the project-team Gallium.
Deputy scientific director at INRIA in charge of Algorithmics, Programming, Software, and Architecture.
2006 - 2013
Senior research scientist at INRIA in the project-team Gallium.
1998 - 2005
Senior research scientist at INRIA in the project-team Cristal.
1991 - 1998
Research scientist at INRIA in the project-team Cristal.
1990 - 1991
Post-doc at University of Pennsylvania in Carl Gunter and Val Tannen’s group.
1987 - 1990
PhD student at INRIA in the Formel project-team. under Gérard Huet’s supervision.

Teaching Experience

2008 - now
Taught Functional programming and type systems to graduate students of the Parisian Master of Research in Computer Science (MPRI).
1998 - 2006
Professor at École Polytechnique: taught Modularity and object-oriented programming, Compilation, and Understanding and programming operating systems to last year students.
1992 - 1998
Associate Professor at École Polytechnique: taught Programming and Algorithms to first year students; Languages and Compilation to second year students.
1996
Taught Object-oriented languages to first-year students of École Normale Supérieure:.
1995 - 1997
Taught Type systems and operational semantics to graduate students of École Normale Supérieure, École Polytechnique, and Universities of Paris 6 and Paris 7.
1993 - 1995
Taught Type systems and operational semantics to graduate level of University of Paris 7.

PhD supervision

Thomas William
Since September 2014
Putting ornaments into practice.
Gabriel Scherer
Since September 2011
Inference of program sckeleton from singleton types.
Julien Cretin
Thèse de l’université de Paris 7, soutenue en janvier Graduated from University of Paris 7 in January 2014
Erasable coercions: a unified approach to type systems
Benoit Montagu
Graduated from University of Paris 7 in December 2010
Programming with first-class modules in a core language with subtyping, singleton kinds and open existential types
Boris Yakobowski
Graduated from University of Paris 7 in December 2008
Graphical types and constraints: second-order polymorphism and inference.
Daniel Bonniot
Graduated from Écoles des Mines de Paris in November 2005
Modular Typechecking of Multi-Methods.
Alexandre Frey
Graduated from École des Mines de Paris in June 2004
An algebraic approach to typechecking an ML-like language with objects, subtyping, and multi-methods.
Didier Le Botlan
Graduated from École Polytechnique in May 2004
MLF: An extension of ML with second-order polymorphism and explicit instantiation.
Jérôme Vouillon
Graduated from University of Paris 7 in September 2000
Design and implementation of an extension of ML with objets.
François Pottier
Graduated from University of Paris 7 in June 1998
Type inference with subtyping constraints.

PhD Examination

Cédric Pasteur
Committee member for his PhD dissertation, École Doctorale Informatique, télécommunications, et électronique de Paris. (ED130) (2013)
Thomaz Blanc
Committee member for his PhD dissertation, École Polytechnique (2006)
Fabien Dagnat
Reviewer for his PhD dissertation, Institut National Polytechnique de Toulouse (2001)
Maribel Fernandez
Reviewer for her Habilitation dissertation, Univ. de Paris 11 (2000)
Mina Abdiche
Reviewer for her PhD dissertation, Univ. de Paris 11 (2000)
Silvano Dal Zillio
Reviewer for his PhD dissertation, Univ. de Nice-Sophia Antipoli (1999)
Camille Le Moniès de Sagazan
Reviewer for his PhD dissertation, Univ. Paul Sabatier (1995)
Beppe Castagna
Reviewer for his PhD dissertation, Univ. Paris 7 (1994)
Lucky Chillan
Committee member for his PhD dissertation, Univ. Paris 7 (1993)

Journal editing

  1. Member of the editorial board of Journal of Functional Programming 2002–2011.

Program committees

  1. European Symposium On Programming (ESOP), Eindhoven, The Netherlands. Appril 2016.
  2. Higher-order, typed, inferred, strict: ACM SIGPLAN ML family workshop, Gothenburg, Sweden. September 2014
  3. Ocaml Users and Developpers workshop, 2012. Co-organisateur, co-président du comité de programme.
  4. International Conference on Functional Programming (ICFP), Baltimore, USA, September 2010.
  5. European Symposium On Programming (ESOP), Paphos, Cyprus, March 2010.
  6. ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI), Savannah, Georgia, USA, January 2009.
  7. ACM SIGPLAN Workshop on ML, Victoria, British Columbia, Canada, September 2008.
  8. European Symposium On Programming (ESOP), Vienna, Austria, April 2006.
  9. Foundations and Developments of Object-Oriented Languages (FOOL/WOOD), Charleston USA, January 2006.
  10. Journées Francophones des Langages Applicatifs (JFLA), France, 2005.
  11. Programming Language Design and Implementation (PLDI), Washington DC, USA, June 2004.
  12. European Symposium On Programming (ESOP), France, April 2002.
  13. (Member of the steering committee) Ocaml Users and Developpers Workshop (OCaml). (2012–now)
  14. (Member of the steering committee) International Conference on Functional Programming (ICFP). (1997–2000)
  15. (Member of the steering committee) Foundations of Object Oriented Programming (FOOL). (1998–2001)
  16. (General Chair) International Conference on Functional Programming (ICFP), September 1999.
  17. Principle Of Programming Languages (POPL), San Antonio, Texas, USA, January 1999.
  18. (Program Chair) Workshop on Foundations of Object-Oriented Languages (FOOL), San Diego, USA, January 1998.
  19. Workshop on Foundations of Object-Oriented Languages (FOOL), New Brunswick, USA, July 1996.
  20. International Conference on Functional Programming (ICFP), Philadelphia, USA, May 1996 .
  21. European Symposium On Programming (ESOP), Sweden, April 1996.
  22. Journées Francophones des Langages Applicatifs (JFLA), Montreal, Canada, 1996.
  23. (Program Chair) Workshop on ML and its Applications, Orlando, USA, June 1994.

Software development

  1. Author of WhizzyTEX —an gnu-emacs mode for WYSIWYG incremental previewing LATEX documents while editing.
  2. One of the main contributors to Active-DVI an OCaml DVI previewer.
  3. Indirect contributions to the OCaml implementation, in particular its object-oriented layer, but also its typechecker, and the addition of polymorphic methods, GADTs.
  4. ML-ART: Prototype extension of Caml-Light with extensible records, universal and existential types, and programmable class-based objects.

Other activities

Prices

Publications: Journal articles

[1]
Didier Rémy and Boris Yakobowski. A church-style intermediate language for MLF. Theoretical Computer Science, 435(1):77–105, June 2012.
[2]
Didier Le Botlan and Didier Rémy. Recasting MLF. Information and Computation, 207(6):726–785, 2009.
[3]
Jacques Garrigue and Didier Rémy. Extending ML with semi-explicit higher-order polymorphism. Information and Computation, 155(1/2):134–169, 1999. A preliminary version appeared in TACS’97.
[4]
Didier Rémy and Jérôme Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27–50, 1998. A preliminary version appeared in the proceedings of the 24th ACM Conference on Principles of Programming Languages, 1997.
[5]
Martín Abadi, Luca Cardelli, Benjamin C. Pierce, and Didier Rémy. Dynamic typing in polymorphic languages. Journal of Functional Programming, 5(1):111–130, January 1995. Also appeared as SRC Research Report 120. Preliminary version appeared in the Proceedings of the ACM SigPlan Workshop on ML and its Applications, June 1992.

Publications: Book chapters

[6]
François Pottier and Didier Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389–489. MIT Press, 2005.
[7]
Didier Rémy. Using, Understanding, and Unraveling the OCaml Language. In Gilles Barthe, editor, Applied Semantics. Advanced Lectures. LNCS 2395., pages 413–537. Springer Verlag, 2002.
[8]
Didier Rémy. Type inference for records in a natural extension of ML. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
[9]
Didier Rémy. Typing record concatenation for free. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.

Publications: Conference articles

[10]
Gabriel Scherer and Didier Rémy. Which simple types have a unique inhabitant? In Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015, pages 243–255, 2015.
[11]
Gabriel Scherer and Didier Rémy. Full reduction in the face of absurdity. In Programming Languages and Systems - 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, pages 685–709, 2015.
[12]
Julien Cretin and Didier Rémy. System F with Coercion Constraints. In Logics In Computer Science (LICS). ACM, July 2014.
[13]
Jacques Garrigue and Didier Rémy. Ambivalent Types for Principal Type Inference with GADTs. In 11th Asian Symposium on Programming Languages and Systems, Melbourne, Australia, December 2013.
[14]
Gabriel Scherer and Didier Rémy. GADTs meet subtyping. In Proceedings of the 22Nd European Conference on Programming Languages and Systems, ESOP’13, pages 554–573, Berlin, Heidelberg, 2013. Springer-Verlag.
[15]
Julien Cretin and Didier Rémy. On the Power of Coercion Abstraction. In Proceedings of the 39th ACM Symposium on Principles of Programming Languages (POPL 2012), Philadephia, PA, USA, January 2012.
[16]
Didier Rémy and Boris Yakobowski. A church-style intermediate language for MLF. In Matthias Blume, Naoki Kobayashi, and German Vidal, editors, Functional and Logic Programming, volume 6009 of Lecture Notes in Computer Science, pages 24–39. Springer Berlin / Heidelberg, 2010.
[17]
Benoît Montagu and Didier Rémy. Modeling abstract types in modules with open existential types. In Proceedings of the 36th ACM Symposium on Principles of Programming Languages (POPL’09), pages 354–365, Savannah, GA, USA, January 2009.
[18]
Didier Rémy and Boris Yakobowski. Efficient Type Inference for the MLF language: a graphical and constraints-based approach. In The 13th ACM SIGPLAN International Conference on Functional Programming (ICFP’08), pages 63–74, Victoria, BC, Canada, September 2008.
[19]
Didier Rémy. Simple, partial type-inference for System F based on type-containment. In Proceedings of the tenth International Conference on Functional Programming, September 2005.
[20]
Roberto Di Cosmo, François Pottier, and Didier Rémy. Subtyping recursive types modulo associative commutative products. In Seventh International Conference on Typed Lambda Calculi and Applications (TLCA’05), Nara, Japan, April 2005.
[21]
Didier Le Botlan and Didier Rémy. MLF: Raising ML to the power of System F. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 27–38, August 2003.
[22]
Cédric Fournet, Luc Maranget, Cosimo Laneve, and Didier Rémy. Inheritance in the join calculus. In Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science. Springer, December 2000.
[23]
Didier Rémy. From classes to objects via subtyping. In European Symposium On Programming, volume 1381 of Lecture Notes in Computer Science. Springer, March 1998.
[24]
Jacques Garrigue and Didier Rémy. Extending ML with semi-explicit higher-order polymorphism. In International Symposium on Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 20–46. Springer, September 1997.
[25]
Didier Rémy and Jérôme Vouillon. Objective ML: A simple object-oriented extension of ml. In Proceedings of the 24th ACM Conference on Principles of Programming Languages, pages 40–53, Paris, France, January 1997.
[26]
Cédric Fournet, Luc Maranget, Cosimo Laneve, and Didier Rémy. Implicit typing à la ML for the join-calculus. In 8th International Conference on Concurrency Theory (CONCUR’97), volume 1243 of Lecture Notes in Computer Science, pages 196–212, Warsaw, Poland, 1997. Springer.
[27]
Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In 7th International Conference on Concurrency Theory (CONCUR’96), volume 1119 of Lecture Notes in Computer Science, pages 406–421, Pisa, Italy, August 26-29 1996. Springer.
[28]
Carl A. Gunter, Didier Rémy, and Jon G. Riecke. A generalization of exceptions and control in ML. In Proc. ACM Conf. on Functional Programming and Computer Architecture, June 1995.
[29]
Didier Rémy. Programming objects with ML-ART: An extension to ML with abstract and record types. In Masami Hagiya and John C. Mitchell, editors, International Symposium on Theoretical Aspects of Computer Software, number 789 in Lecture Notes in Computer Science, pages 321–346, Sendai, Japan, April 1994. Springer-Verlag.
[30]
Didier Rémy. Projective ML. In 1992 ACM Conference on Lisp and Functional Programming, pages 66–75, New-York, 1992. ACM press.
[31]
Didier Rémy. Typing record concatenation for free. In Nineteenth Annual Symposium on Principles Of Programming Languages, pages 166–176, 1992.
[32]
Didier Rémy. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989. See also [8].

Other publications

[33]
Gabriel Scherer and Didier Rémy. Which simple types have a unique inhabitant? Extended version of [10], 2015.
[34]
Gabriel Scherer and Didier Rémy. Full reduction in the face of absurdity. Research report, INRIA, December 2014.
[35]
Didier Rémy and Julien Cretin. From amber to coercion constraints. In Martin Abadi, Philippa Gardner, Andrew D. Gordon, and Radu Mardare, editors, Essays for the Luca Cardelli Fest, number MSR-TR-2014-104 in TechReport. Microsoft Research, September 2014.
[36]
Thomas Williams, Pierre-Évariste Dagand, and Didier Rémy. Ornaments in practice. September 2014.
[37]
Thomas Williams, Pierre-Évariste Dagand, and Didier Rémy. Ornaments in practice. In WGP+ ’14: Proceedings of the 10th ACM SIGPLAN Workshop on Generic Programming, New York, NY, USA, July 2014. ACM.
[38]
Julien Cretin and Didier Rémy. System F with Coercion Constraints. Rapport de recherche RR-8456, INRIA, January 2014.
[39]
Julien Cretin and Didier Rémy. Coherent coercion abstration with a step-indexed strong-reduction semantics. available at http://gallium.inria.fr/ remy/coercions/, July 2013.
[40]
Jacques Garrigue and Didier Rémy. Tracing ambiguity in GADT type inference. Unpublished, June 2012.
[41]
Julien Cretin and Didier Rémy. Extending System F-eta with Abstraction over Erasable Coercions. Research Report RR-7587, INRIA, July 2011.
[42]
Benoît Montagu and Didier Rémy. Towards a simpler account of modules and generativity: Abstract types have open existential types. January 2008.
[43]
Didier Rémy and Boris Yakobowski. A graphical presentation of MLF types with a linear-time unification algorithm. In Proceedings of the 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI’07), pages 27–38, Nice, France, January 2007. ACM Press.
[44]
Didier Le Botlan and Didier Rémy. Recasting MLF. Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, June 2007.
[45]
Didier Rémy and Boris Yakobowski. A graphical presentation of MLF types with a linear-time incremental unification algorithm. Extended version of [43], July 2006.
[46]
François Pottier and Didier Rémy. The essence of ML type inference. Extended preliminary version of [6], 2003.
[47]
Carl A. Gunter, Didier Rémy, and Jon G. Riecke. Return types for functional continuations. A preliminary version appeared as [28], 1998.
[48]
Didier Rémy. Re-exploring multiple inheritance. Invited talk at FOOL’7, January 2000.
[49]
Didier Rémy and Jérôme Vouillon. The reality of virtual types for free! Unpublished note avaliable electronically, October 1998.
[50]
Didier Rémy. Des enregistrements aux objets. Mémoire d’habilitation à diriger des recherches, Université de Paris 7, 1998.
[51]
Didier Rémy. From classes to objects via subtyping. A preliminary version appeared in LNCS 1381 (ESOP 98), June 1998.
[52]
Didier Rémy. A case study of typechecking with constrained types: Typing record concatenation. Presented at the workshop on Advances in types for computer science at the Newton Institute, Cambridge, UK, August 1995.
[53]
Didier Rémy. Better subtypes and row variables for record types. Presented at the workshop on Advances in types for computer science at the Newton Institute, Cambridge, UK, August 1995.
[54]
Benjamin C. Pierce, Didier Rémy, and David N. Turner. A typed higher-order programming language based on the pi-calculus. A preliminary version was presented at the Workshop on Type Theory and its Application to Computer Systems, Kyoto University, July 1993.
[55]
Carl A. Gunter and Didier Rémy. A proof-theoretic assessment of runtime type errors. Research Report 11261-921230-43TM, AT&T Bell Laboratories, 600 Mountain Ave, Murray Hill, NJ 07974-2070, 1993.
[56]
Didier Rémy. Efficient representation of extensible records. In Proceedings of the 1992 workshop on ML and its Applications, page 12, San Francisco, USA, June 1992.
[57]
Didier Rémy. Extending ML type system with a sorted equational theory. Research Report 1766, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1992.
[58]
Didier Rémy. Type Systems for Programming Languages. Course notes, available electronically, 2015.
[59]
Xavier Leroy and Didier Rémy. Programmation du système Unix en OCaml. Course notes, available electronically, 2008.
[60]
Didier Rémy. Syntactic theories and the algebra of record terms. Research Report 1869, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1993.
[61]
Didier Rémy. Type inference for records in a natural extension of ML. Research Report 1431, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, May 1991. See also [8] and [32].
[62]
Didier Rémy. Algèbres Touffues. Application au Typage Polymorphe des Objets Enregistrements dans les Langages Fonctionnels. Thèse de doctorat, Université de Paris 7, 1990.