| The differential lambda-calculus T Ehrhard, L Regnier Theoretical Computer Science 309 (1-3), 1-41, 2003 | 450 | 2003 |
| Finiteness spaces T Ehrhard Mathematical Structures in Computer Science 15 (4), 615-646, 2005 | 241 | 2005 |
| Differential interaction nets T Ehrhard, L Regnier Theoretical Computer Science 364 (2), 166-195, 2006 | 202 | 2006 |
| Uniformity and the Taylor expansion of ordinary lambda-terms T Ehrhard, L Regnier Theoretical Computer Science 403 (2-3), 347-372, 2008 | 170 | 2008 |
| On Köthe sequence spaces and linear logic T Ehrhard Mathematical Structures in Computer Science 12 (5), 579-623, 2002 | 150 | 2002 |
| Probabilistic coherence spaces as a model of higher-order probabilistic computation V Danos, T Ehrhard Information and Computation 209 (6), 966-991, 2011 | 128 | 2011 |
| An introduction to differential linear logic: proof-nets, models and antiderivatives T Ehrhard Mathematical Structures in Computer Science 28 (7), 995-1060, 2018 | 122 | 2018 |
| Böhm trees, Krivine’s machine and the Taylor expansion of lambda-terms T Ehrhard, L Regnier Conference on Computability in Europe, 186-197, 2006 | 118 | 2006 |
| Sequentiality and strong stability A Bucciarelli, T Ehrhard Proceedings 1991 Sixth Annual IEEE Symposium on Logic in Computer Science …, 1991 | 117 | 1991 |
| Probabilistic coherence spaces are fully abstract for probabilistic PCF T Ehrhard, C Tasson, M Pagani Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014 | 114 | 2014 |
| On phase semantics and denotational semantics: the exponentials A Bucciarelli, T Ehrhard Annals of Pure and Applied Logic 109 (3), 205-241, 2001 | 107 | 2001 |
| Hypercoherences: a strongly stable model of linear logic T Ehrhard Mathematical Structures in Computer Science 3 (4), 365-385, 1993 | 105 | 1993 |
| Not enough points is enough A Bucciarelli, T Ehrhard, G Manzonetto Computer Science Logic: 21st International Workshop, CSL 2007, 16th Annual …, 2007 | 101 | 2007 |
| Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming T Ehrhard, M Pagani, C Tasson Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017 | 98 | 2017 |
| Collapsing non-idempotent intersection types T Ehrhard Computer Science Logic (CSL'12)-26th International Workshop/21st Annual …, 2012 | 90 | 2012 |
| A convenient differential category R Blute, T Ehrhard, C Tasson arXiv preprint arXiv:1006.3140, 2010 | 85 | 2010 |
| A categorical semantics of constructions T Ehrhard LICS, 264-273, 1988 | 83 | 1988 |
| Believe it or not, AJM's games model is a model of classical linear logic P Baillot, V Danos, T Ehrhard, L Regnier Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 68-75, 1997 | 73 | 1997 |
| The Scott model of linear logic is the extensional collapse of its relational model T Ehrhard Theoretical Computer Science 424, 20-45, 2012 | 72 | 2012 |
| Full abstraction for probabilistic PCF T Ehrhard, M Pagani, C Tasson Journal of the ACM (JACM) 65 (4), 1-44, 2018 | 67 | 2018 |