| A core quantitative coeffect calculus A Brunel, M Gaboardi, D Mazza, S Zdancewic European Symposium on Programming Languages and Systems, 351-370, 2014 | 124 | 2014 |
| Distilling abstract machines B Accattoli, P Barenbaum, D Mazza ACM SIGPLAN Notices 49 (9), 363-376, 2014 | 90 | 2014 |
| Polyadic approximations, fibrations and intersection types D Mazza, L Pellissier, P Vial Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017 | 59 | 2017 |
| Linear logic by levels and bounded time complexity P Baillot, D Mazza Theoretical Computer Science 411 (2), 470-503, 2010 | 58 | 2010 |
| Automatic differentiation in PCF D Mazza, M Pagani Proceedings of the ACM on Programming Languages 5 (POPL), 1-27, 2021 | 50 | 2021 |
| Backpropagation in the simply typed lambda-calculus with linear negation A Brunel, D Mazza, M Pagani Proceedings of the ACM on Programming Languages 4 (POPL), 1-27, 2019 | 50 | 2019 |
| Simple parsimonious types and logarithmic space D Mazza 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015 | 45 | 2015 |
| Parsimonious types and non-uniform computation D Mazza, K Terui Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 36 | 2015 |
| An infinitary affine lambda-calculus isomorphic to the full lambda-calculus D Mazza 2012 27th Annual IEEE Symposium on Logic in Computer Science, 471-480, 2012 | 34 | 2012 |
| Multiport interaction nets and concurrency D Mazza International Conference on Concurrency Theory, 21-35, 2005 | 32 | 2005 |
| Linear logic and polynomial time D Mazza Mathematical Structures in Computer Science 16 (6), 947-988, 2006 | 30 | 2006 |
| The separation theorem for differential interaction nets D Mazza, M Pagani Logic for Programming, Artificial Intelligence, and Reasoning: 14th …, 2007 | 28 | 2007 |
| Interaction nets: Semantics and concurrent extensions D Mazza These de doctorat, Université Aix-Marseille II/Universita degli Studi Roma Tre, 2006 | 28 | 2006 |
| A strong distillery B Accattoli, P Barenbaum, D Mazza Asian Symposium on Programming Languages and Systems, 231-250, 2015 | 24 | 2015 |
| Non-uniform polytime computation in the infinitary affine lambda-calculus D Mazza International Colloquium on Automata, Languages, and Programming, 305-317, 2014 | 20 | 2014 |
| The true concurrency of differential interaction nets D Mazza Mathematical Structures in Computer Science 28 (7), 1097-1125, 2018 | 19 | 2018 |
| Polyadic Approximations in Logic and Computation D Mazza Université Paris 13, 2017 | 16 | 2017 |
| Intersection types and runtime errors in the pi-calculus U Dal Lago, M de Visme, D Mazza, A Yoshimizu Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 15 | 2019 |
| Infinitary affine proofs D Mazza Mathematical Structures in Computer Science 27 (5), 581-602, 2017 | 8 | 2017 |
| A denotational semantics for the symmetric interaction combinators D Mazza Mathematical Structures in Computer Science 17 (3), 527-562, 2007 | 8 | 2007 |
Michele PaganiProfessor of Computer Science, Université de ParisVerified email at irif.fr
