| Weighted relational models of typed lambda-calculi J Laird, G Manzonetto, G McCusker, M Pagani 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 301-310, 2013 | 126 | 2013 |
| Applying quantitative semantics to higher-order quantum computing M Pagani, P Selinger, B Valiron Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014 | 117 | 2014 |
| 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 | 111 | 2014 |
| 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 | 93 | 2017 |
| A semantic measure of the execution time in linear logic D De Carvalho, M Pagani, LT de Falco Theoretical Computer Science 412 (20), 1884-1902, 2011 | 90 | 2011 |
| Solvability in resource lambda-calculus M Pagani, SR Della Rocca Foundations of Software Science and Computational Structures: 13th …, 2010 | 69 | 2010 |
| Full abstraction for probabilistic PCF T Ehrhard, M Pagani, C Tasson Journal of the ACM (JACM) 65 (4), 1-44, 2018 | 64 | 2018 |
| Automatic differentiation in PCF D Mazza, M Pagani Proceedings of the ACM on Programming Languages 5 (POPL), 1-27, 2021 | 57 | 2021 |
| The computational meaning of probabilistic coherence spaces T Ehrhard, M Pagani, C Tasson 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 87-96, 2011 | 57 | 2011 |
| 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 | 52 | 2019 |
| Parallel reduction in resource lambda-calculus M Pagani, P Tranquilli Asian Symposium on Programming Languages and Systems, 226-242, 2009 | 49 | 2009 |
| Strong normalization property for second order linear logic M Pagani, LT de Falco Theoretical Computer Science 411 (2), 410-444, 2010 | 48 | 2010 |
| Linearity, non-determinism and solvability M Pagani, SRD Rocca Fundamenta Informaticae 103 (1-4), 173-202, 2010 | 43 | 2010 |
| Revisiting Call-by-value B\" ohm trees in light of their Taylor expansion E Kerinec, G Manzonetto, M Pagani Logical Methods in Computer Science 16, 2020 | 32 | 2020 |
| Modelling coeffects in the relational semantics of linear logic F Breuvart, M Pagani 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015 | 31 | 2015 |
| The separation theorem for differential interaction nets D Mazza, M Pagani Logic for Programming, Artificial Intelligence, and Reasoning: 14th …, 2007 | 28 | 2007 |
| The cut-elimination theorem for differential nets with promotion M Pagani International Conference on Typed Lambda Calculi and Applications, 219-233, 2009 | 25 | 2009 |
| The free exponential modality of probabilistic coherence spaces R Crubillé, T Ehrhard, M Pagani, C Tasson International Conference on Foundations of Software Science and Computation …, 2017 | 23 | 2017 |
| Strong Normalizability as a Finiteness Structure via the Taylor Expansion of -terms M Pagani, C Tasson, L Vaux International Conference on Foundations of Software Science and Computation …, 2016 | 21 | 2016 |
| Call-by-value non-determinism in a linear logic type discipline A Díaz-Caro, G Manzonetto, M Pagani International Symposium on Logical Foundations of Computer Science, 164-178, 2013 | 21 | 2013 |
Christine TassonProfessorisae-supaero.fr의 이메일 확인됨
