Pierre-Louis Curien

Directeur de Recherche au CNRS

PPS (Programmes, Preuves et Systèmes) (UMR 7126 CNRS - Université Paris 7)
Email:curien@pps.jussieu.fr

Visitez le site de mon frère Christophe Curien (peintre et sculpteur)

Research interests (programming languages and proof theory):

lambda calculi (and explicit substitutions)
typing (in particular: subtyping, parametricity)
domain theory (in particular: sequentiality)
linear logic
games semantics
classical logic

Recent prepublications and publications (see also my publication list )

(with Roberto Amadio) Domains and Lambda-calculi, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (1998) ( ABSTRACT ).
(with Gérard Boudol and Carolina Lavatelli) A semantics for Lambda-calculi with resources , Mathematical Structures in Computer Science 9 (4) (1999).
(with Gordon Plotkin and Glynn Winskel) Bistructure models of linear logic , Milner Festschrift, MIT Press (2000) ( ABSTRACT ).
Abstract Boehm trees , Mathematical Structures in Computer Science 8(6) (1998) ( ABSTRACT ).
(with Hugo Herbelin) Computing with abstract Boehm trees, (Proc. Third Fuji International Symposium on Functional and Logic Programming, April 1998, Kyoto, World Scientific (1998).
Sur l'eta-expansion infinie, Comptes Rendus de l'Académie des Sciences 334, Sec. I, 77-82 (2002).
(with Hugo Herbelin) The duality of computation , Proc. International Conference on Functional Programming, September 2000, Montréal, IEEE (2000).
Abstract machines, control, and sequents , Proc. APPSEM Summer School, Caminha, Sept. 2000, LNCS 2395, Springer.
Symmetry and interactivity in programming, Bulletin of Symbolic Logic, Vol. 9(2), 169-180 (2003).
Sequential algorithms as bistable maps, to appear in a commemorative volume in honour of Gilles Kahn.
Playful, streamlike computation, Proc. Int. Symp. on Domain Theory, Chengdu, 2001, Kluwer.
Introduction to linear logic and ludics, part I, and part II , Advances in Mathematics (China) 34 (5), 513-544 (2005) and 35 (1), 1-44 (2006).
Definability and full abstraction , Gordon Plotkin Festschrift, ENTCS 172 (2007).
(with Hugo Herbelin) Abstract machines for dialogue games, to appear in a volume Interactive models of computation and program behaviour of the collection Panoramas et Synthèses of the SMF.
(with Claudia Faggian) An approach to innocent strategies as graphs, submitted.
(with Vincent Danos, Jean Krivine, and Zhang Min) Computational self-assembly, to appear in Theoretical Computer Science.
Operads, clones, and distributive laws , version of 20/10/08, manuscript.
(with Guillaume Munch-Maccagnoni) The duality of computation under focus , version of June 2010, slightly more expanded than the version to be published in the Proc. of IFIP TCS 2010.

Some older publications

Substitutiuon up to isomorphism, Fundamenta Informaticae 19, 51-85 (1993).
(with Martin Abadi, Luca Cardelli and Jean-Jacques Lévy) Explicit substitutions , Journal of Functional Programming 1(4), 375-416 (1992).
(with Martin Abadi and Luca Cardelli)) Formal parametric polymorphism , Boehm Festschrift Volume, Theoretical Computer Science 121 (1-2), 9-58 (1993).

Introductory course notes

Introductory slides to ludics for the Spring School in Agay, March 2002.

Introduction to CCS and pi-calculus (still incomplete notes), December 2002.
Notes on game semantics, September 2006.
Category theory: a programming language introduction, version of 20/10/08.

Biographie scientifique

Une brève biographie scientifique de Maurice Nivat, special issue of TCS dedicated to Maurice Nivat, Theoretical Computer Science 281 (1-2) (2002).

Enseignement

Cours de théorie de la démonstration, première partie et compléments, M2 LMFI.
Poly (partiel, inachevé) de Cours de Magistère.
Documents de travail 1999 , et 2000 pour l'Oral d'Informatique aux concours d'entrée aux ENS (Cachan, Lyon, Ulm en 1999; Lyon, Ulm en 2000).

Talks

Sémantique opérationnelle (avril 2001, transparents et texte. )
Games in computer science: a survey (talk at Moscow Independent University, April 2005).
An approach to innocent strategies as games (slides for an invited contribution at the workshop Current trends in Concurrency Theory, Ecole Polytechnique, Nov. 2006).
What can sequent calculus do for functional programs? (talk at the Computer Lab., Cambridge, June 2009).