| The Structural λ-Calculus B Accattoli, D Kesner International Workshop on Computer Science Logic, 381-395, 2010 | 125 | 2010 |
| Distilling abstract machines B Accattoli, P Barenbaum, D Mazza ACM SIGPLAN Notices 49 (9), 363-376, 2014 | 97 | 2014 |
| Beta reduction is invariant, indeed B Accattoli, U Dal Lago Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 94* | 2014 |
| A nonstandard standardization theorem B Accattoli, E Bonelli, D Kesner, C Lombardi ACM SIGPLAN Notices 49 (1), 659-670, 2014 | 79 | 2014 |
| An abstract factorization theorem for explicit substitutions B Accattoli 23rd International Conference on Rewriting Techniques and Applications (RTA'12), 2012 | 72 | 2012 |
| Call-by-value solvability, revisited B Accattoli, L Paolini Functional and Logic Programming: 11th International Symposium, FLOPS 2012 …, 2012 | 71 | 2012 |
| Open call-by-value B Accattoli, G Guerrieri Programming Languages and Systems: 14th Asian Symposium, APLAS 2016, Hanoi …, 2016 | 65 | 2016 |
| On the invariance of the unitary cost model for head reduction B Accattoli, U Dal Lago 23rd International Conference on Rewriting Techniques and Applications (RTA …, 2012 | 65 | 2012 |
| On the relative usefulness of fireballs B Accattoli, CS Coen 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 141-155, 2015 | 53 | 2015 |
| Proof nets and the call-by-value λ-calculus B Accattoli Theoretical Computer Science 606, 2-24, 2015 | 49 | 2015 |
| Tight typings and split bounds, fully developed B Accattoli, S Graham-Lengrand, D Kesner Journal of Functional Programming 30, e14, 2020 | 46 | 2020 |
| The Permutative λ-Calculus B Accattoli, D Kesner International Conference on Logic for Programming Artificial Intelligence …, 2012 | 46 | 2012 |
| Environments and the complexity of abstract machines B Accattoli, B Barras Proceedings of the 19th International Symposium on Principles and Practice …, 2017 | 45 | 2017 |
| Types of fireballs B Accattoli, G Guerrieri Programming Languages and Systems: 16th Asian Symposium, APLAS 2018 …, 2018 | 42 | 2018 |
| Proof nets and the linear substitution calculus B Accattoli International Colloquium on Theoretical Aspects of Computing, 37-61, 2018 | 37 | 2018 |
| Tight typings and split bounds B Accattoli, S Graham-Lengrand, D Kesner Proceedings of the ACM on Programming Languages 2 (ICFP), 1-30, 2018 | 36 | 2018 |
| Jumping boxes: representing lambda-calculus boxes by jumps B Accattoli, S Guerrini International Workshop on Computer Science Logic, 55-70, 2009 | 32 | 2009 |
| Strong call-by-value is reasonable, implosively B Accattoli, A Condoluci, CS Coen 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2021 | 31 | 2021 |
| Types by Need. B Accattoli, G Guerrieri, M Leberle ESOP, 410-439, 2019 | 30 | 2019 |
| Preservation of strong normalisation modulo permutations for the structural lambda-calculus B Accattoli, D Kesner Logical Methods in Computer Science 8, 2012 | 30 | 2012 |
Giulio GuerrieriDepartment of Computer Science, University of Bathbath.ac.uk의 이메일 확인됨