|
|
|
|
Dernière mis à jour : 21/11/2011
Laboratoire PPS
Université Paris Diderot - Paris 7
Case 7014
75205 PARIS Cedex 13
Tél : +33-1 44 27 53 05
thomas.ehrhard@pps.univ-paris-diderot.fr
Je suis chercheur au CNRS, directeur du laboratoire Preuves, Programmes et Systèmes (PPS).
Je m'intéresse à la logique, et plus particulièrement à la théorie de la démonstration, dans les rapports qu'elle entretient avec l'informatique théorique à travers l'isomorphisme de Curry-Howard. On trouvera dans ce texte une présentation générale de mes travaux.
Je me suis occupé du projet Geocal de l'ACI Nouvelles Interfaces des Mathématiques, de septembre 2003 à septembre 2006.
J'ai été responsable du projet blanc ANR Curry-Howard pour la concurrence CHOCO, de novembre 2007 à avril 2011. Voici un résumé du projet et une présentation plus complète, extraits du dossier de candidature.
Je suis membre du groupe de travail Geocal du GDR Informatique Mathématique.
Notes de cours de master sur le lambda-calcul et ses modèles (version du 21 novembre 2011).
L'examen ne portera pas sur le lambda-calcul avec ressources.
Pour mémoire, le matériel de mon cours en 2007-2008.
Hypercoherences: a strongly stable model of linear logic. Mathematical Structures in Computer Science, Cambridge University Press. 1993. pdf.
On strong stability and higher-order sequentiality. Logic in Computer Science. Ninth Symposium on Logic in Computer Science, Paris, 1994. IEEE. 1994. pdf.
Sequentiality in an extensional framework. Information and Computation, Academic Press. 1994. pdf.
Projecting sequential algorithms on strongly stable functions. Annals of Pure and Applied Logic, North Holland. 1996. pdf.
Anatomy of an extensional collapse. 1997. Unpublished manuscript. pdf.
A relative definability result for strongly stable functions and some corollaries. Information and Computation, Academic Press. 1999. pdf.
Parallel and serial hypercoherences. Theoretical Computer Science, Elsevier. 2000. pdf.
On phase semantics and denotational semantics in multiplicative-additive linear logic. Annals of Pure and Applied Logic, North Holland. 2000. pdf.
On phase semantics and denotational semantics: the exponentials. Annals of Pure and Applied Logic, North Holland. 2001. pdf.
On Köthe sequence spaces and linear logic. Mathematical Structures in Computer Science, Cambridge University Press. 2002. pdf.
A completeness theorem for symmetric product phase spaces. Journal of Symbolic Logic, Association for Symbolic Logic. 2004. pdf.
The differential lambda-calculus. Theoretical Computer Science, Elsevier. 2004. pdf.
Web based models of linear logic. Slides of my talk at WoLLIC'04, Fontainebleau. 2004. pdf.
Finiteness spaces. Mathematical Structures in Computer Science, Cambridge University Press. 2005. pdf.
Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science, Elsevier. 2006. To appear. pdf.
Differential interaction nets. Theoretical Computer Science, Elsevier. 2006. To appear. pdf.
Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006. Lecture Notes in Computer Science. Springer Verlag. 2006. Extended abstract. pdf.
Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. 2006. Long version. pdf.
Embedding the pi-calculus in differential interaction nets. Slides of my talk at the conference Computability in Europe 2006 (CiE 2006), Swansea. 2006. pdf.
Embedding the Finitary Pi-calculus in Differential Interaction Nets. 2006. Electronically published proceedings. Available here.
On differential interaction nets and the pi-calculus. 2006. HAL technical report ccsd-00096280, version 1. Available here.
On finiteness spaces and extensional presheaves over the Lawvere theory of polynomials. 2007. Accepted for publication in the Journal of Pure and Applied Algebra. pdf.
Not enough points is enough. 2007. Computer Science Logic. pdf.
Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. 2007. CONCUR, conference short version. pdf.
Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. 2007. Slides of a talk given at University Roma III, the 16th of April. pdf.
A relational model of a parallel and non-deterministic lambda-calculus. 2008. Accepted at LFCS 09. .
On probabilistic coherence spaces. 2008. PPS and CHOCO technical report. To appear in Information and Computation. pdf.
Acyclic Solos and Differential Interaction Nets. 2008. PPS and CHOCO technical report. Paru dans Logical Methods in Computer Science 6(3), 2010. pdf.
The Scott model of Linear Logic is the extensional collapse of its relational model. 2009. Submitted for publication. pdf.
A relational semantics for parallelism and non-determinism in a functional setting. Annals of Pure and Applied Logic, Elsevier. 2009. To appear in 2011. pdf.
Resource Combinatory Algebras. 2010. MFCS 2010. pdf.
A Finiteness Structure on Resource Terms. 2010. LICS 2010. pdf.
Exponentials with Infinite Multiplicities. 2010. CSL 2010. pdf.
Categorical Models for Simply Typed Resource Lambda-Calculus. 2010. MFPS 2010. pdf.
Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. Information and Computation, Elsevier. 2010. 208(6), pp. 606-633. pdf.
Full Abstraction for Resource Calculus with Tests. 2011. Accepted at CSL 2011, Bergen. pdf.
A Convenient Differential Category. Cahier de Topologie et Géométrie Différentielle Catégoriques, . 2011. To appear. pdf.
CCS for trees. 2011. Submitted for publication. pdf.
A model-oriented introduction to differential linear logic. 2011. Submitted for publication. pdf.
Resource lambda-calculus: the differential viewpoint. 2011. Slides of an invited talk at CSL 2011, Bergen. pdf.
The Computational Meaning of Probabilistic Coherence Spaces. 2011. Accepted at LICS 2011. pdf.
An application of the extensional collapse of the relational model of linear logic. 2012. Submitted. pdf.