Didier RÉMY 56, rue de la Tombe Issoire F-75 014 Paris Phone: 33-1-4335 3773 Born on April 8th, 1963. French citizen.

Curriculum Vitæ Rocquencourt, November 2007

Current position

• Senior Researcher at INRIA-Rocquencourt.

Interests

Design and formalization of programming languages.
In particular:

• type systems and type inference,
• modularity, object-oriented languages,
• concurrent and distributed languages,
• operational semantics.

Education

• Habilitation dissertation, University of Paris 7, 1998.
• PhD (thèse de doctorat) in Computer Science, University of Paris 7, 1990 (advisor: Gérard Huet)
• Undergraduate studies at École Polytechnique (Engineer degree), 1983–1986.

Research experience

2006 - now

Senior research scientist (directeur de recherche) at INRIA Rocquencourt, in the project-team Gallium.

1998 - 2005

Senior research scientist (directeur de recherche) at INRIA Rocquencourt, in the project-team Cristal.

1991 - 1998

Junior research scientist (chargé de recherche) at INRIA Rocquencourt 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 Rocquencourt in the project-team Formel under Gérard Huet’s supervision.

Teaching Experience

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

Benoit Montagu

Since September 2007
A first-class module system

Boris Yakobowski

Since September 2004
Higher-order polymorphism and implicit instanciation.

Daniel Bonniot

Graduated in November 2005
Modular Typechecking of Multi-Methods.

Alexandre Frey

Graduated in June 2004
An algebraic approach to typechecking an ML-like language with objects, subtyping, and multi-methods.

Didier Le Botlan

Graduated in May 2004
ML^F: An extension of ML with second-order polymorphism and explicit instantiation.

Jérôme Vouillon

Graduated in September 2000
Design and implementation of an extension of ML with objets.

François Pottier

Graduated in June 1998
Type inference with subtyping constraints.

PhD Examination

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 since October 2002.

Program committees

1. European Symposium On Programming (ESOP), Vienna, Austria, April 2006.
2. Foundations and Developments of Object-Oriented Languages (FOOL/WOOD), Charleston USA, January 2006.
3. Journées Francophones des Langages Applicatifs (JFLA), France, 2005.
4. Programming Language Design and Implementation (PLDI), Washington DC, USA, June 2004.
5. European Symposium On Programming (ESOP), France, April 2002.
6. (Member of the steering committee) International Conference on Functional Programming (ICFP). (1997–2000)
7. (Member of the steering committee) Foundations of Object Oriented Programming (FOOL). (1998–2001)
8. (General Chair) International Conference on Functional Programming (ICFP), September 1999.
9. Principle Of Programming Languages (POPL), San Antonio, Texas, USA, January 1999.
10. (Program Chair) Workshop on Foundations of Object-Oriented Languages (FOOL), San Diego, USA, January 1998.
11. Workshop on Foundations of Object-Oriented Languages (FOOL), New Brunswick, USA, July 1996.
12. International Conference on Functional Programming (ICFP), Philadelphia, USA, May 1996 .
13. European Symposium On Programming (ESOP), Sweden, April 1996.
14. Journées Francophones des Langages Applicatifs (JFLA), Montreal, Canada, 1996.
15. (Program Chair) Workshop on ML and its Applications, Orlando, USA, June 1994.

Software development

1. Author of WhizzyT_EX —an gnu-emacs mode for WYSIWYG incremental previewing L^AT_EX 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.
4. ML-ART: Prototype extension of Caml-Light with extensible records, universal and existential types, and programmable class-based objects.

Other activities

• Member of IFIP Working Group 2.8 (Functional Programming).
• Site leader of the IST Working Group on Applied Semantics II, 2003-2006;
• General (and local) chair of the PLI’99 symposium in Paris in Sep 1999 collocating the two major conferences ICFP’99 and PPDF’99 and a dozen of workshop.

Publications

Journal and book articles

1. The essence of ML type inference (with François Pottier and Didier Rémy). In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389–489. MIT Press, 2005.

2. Using, Understanding, and Unraveling the OCaml Language. In Gilles Barthe, editor, Applied Semantics. Advanced Lectures. LNCS 2395., pages 413–537. Springer Verlag, 2002.

3. Extending ML with semi-explicit higher-order polymorphism (with Jacques Garrigue). Information and Computation, 155(1/2):134–169, 1999. A preliminary version appeared in TACS’97.

4. Objective ML: An effective object-oriented extension to ML (with Jérôme Vouillon). 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. Dynamic typing in polymorphic languages (with Martín Abadi, Luca Cardelli, Benjamin C. Pierce). 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.

6. 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.

7. 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.

Papers in refereed conferences

1. Simple, partial type-inference for System F based on type-containment. In Proceedings of the tenth International Conference on Functional Programming, September 2005.

2. Subtyping recursive types modulo associative commutative products (with Roberto Di Cosmo, François Pottier, and Didier Rémy). In Seventh International Conference on Typed Lambda Calculi and Applications (TLCA’05), Nara, Japan, April 2005.

3. MLF: Raising ML to the power of System F (with Didier Le Botlan). In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 27–38, August 2003.

4. Inheritance in the join calculus (with Cédric Fournet, Luc Maranget, Cosimo Laneve). In Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science. Springer, December 2000.

5. From classes to objects via subtyping. In European Symposium On Programming, volume 1381 of Lecture Notes in Computer Science. Springer, March 1998.

6. Extending ML with semi-explicit higher-order polymorphism (with Jacques Garrigue). In International Symposium on Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 20–46. Springer, September 1997.

7. Objective ML: A simple object-oriented extension of ml (with Jérôme Vouillon). In Proceedings of the 24th ACM Conference on Principles of Programming Languages, pages 40–53, Paris, France, January 1997.

8. Implicit typing à la ML for the join-calculus (with Cédric Fournet, Luc Maranget, Cosimo Laneve). In 8th International Conference on Concurrency Theory (CONCUR’97), volume 1243 of Lecture Notes in Computer Science, pages 196–212, Warsaw, Poland, 1997. Springer.

9. A calculus of mobile agents (with Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget). 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.

10. A generalization of exceptions and control in ML (with Carl A. Gunter and Jon G. Riecke). In Proc. ACM Conf. on Functional Programming and Computer Architecture, June 1995.

11. 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.

12. Projective ML. In 1992 ACM Conference on Lisp and Functional Programming, pages 66–75, New-York, 1992. ACM press.

13. Typing record concatenation for free. In Nineteenth Annual Symposium on Principles Of Programming Languages, pages 166–176, 1992.

14. Records and variants as a natural extension of ML. In Sixteenth Annual Symposium on Principles Of Programming Languages, 1989. See also X above.

Other publications

1. Mlf made simple (with Didier Le Botlan and Didier Rémy). Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, June 2007.

2. A graphical presentation of MLF types with a linear-time incremental unification algorithm. (with Boris Yakobowski). July 2006.

3. The essence of ML type inference (with François Pottier and Didier Rémy). Extended preliminary version of X above, 2003.

4. Return types for functional continuations (with Carl A. Gunter and Jon G. Riecke). A preliminary version appeared as X above, 1998.

5. Re-exploring multiple inheritance. Invited talk at FOOL’7, January 2000.

6. The reality of virtual types for free! (with Jérôme Vouillon). Unpublished note avaliable electronically, October 1998.

7. Des enregistrements aux objets. Mémoire d’habilitation à diriger des recherches, Université de Paris 7, 1998.

8. From classes to objects via subtyping. A preliminary version appeared in LNCS 1381 (ESOP 98), June 1998.

9. 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.

10. 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.

11. A typed higher-order programming language based on the pi-calculus (with Benjamin C. Pierce and David N. Turner). A preliminary version was presented at the Workshop on Type Theory and its Application to Computer Systems, Kyoto University, July 1993.

12. A proof-theoretic assessment of runtime type errors (with Carl A. Gunter). Research Report 11261-921230-43TM, AT&T Bell Laboratories, 600 Mountain Ave, Murray Hill, NJ 07974-2070, 1993.

13. Efficient representation of extensible records. In Proceedings of the 1992 workshop on ML and its Applications, page 12, San Francisco, USA, June 1992.

14. 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.

15. 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.

16. 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 X above and X above.

17. Algèbres Touffues. Application au Typage Polymorphe des Objets Enregistrements dans les Langages Fonctionnels. Thèse de doctorat, Université de Paris 7, 1990.