Categories, types, and structures A Asperti, G Longo MIT Pr., 1991 | 515 | 1991 |
A machine-checked proof of the odd order theorem G Gonthier, A Asperti, J Avigad, Y Bertot, C Cohen, F Garillot, S Le Roux, ... International conference on interactive theorem proving, 163-179, 2013 | 511 | 2013 |
The optimal implementation of functional programming languages A Asperti, S Guerrini Cambridge University Press, 1998 | 235 | 1998 |
Intuitionistic light affine logic A Asperti, L Roversi ACM Transactions on Computational Logic (TOCL) 3 (1), 137-175, 2002 | 148 | 2002 |
Mobile petri nets A Asperti, N Busi Mathematical Structures in Computer Science 19 (6), 1265-1278, 2009 | 138 | 2009 |
Light affine logic A Asperti Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 129 | 1998 |
The Matita interactive theorem prover A Asperti, W Ricciotti, C Sacerdoti Coen, E Tassi Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011 | 114 | 2011 |
Balancing reconstruction error and kullback-leibler divergence in variational autoencoders A Asperti, M Trentin IEEE Access 8, 199440-199448, 2020 | 108 | 2020 |
User interaction with the Matita proof assistant A Asperti, C Sacerdoti Coen, E Tassi, S Zacchiroli Journal of Automated Reasoning 39, 109-139, 2007 | 104 | 2007 |
Interaction Systems I: The theory of optimal reductions A Asperti, C Laneve Mathematical Structures in Computer Science 11, 1-48, 1993 | 102* | 1993 |
Paths in the lambda-calculus. Three years of communications without understanding A Asperti, V Danos, C Laneve, L Regnier Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 426-436, 1994 | 99 | 1994 |
Mathematical knowledge management in HELM A Asperti, L Padovani, C Sacerdoti Coen, F Guidi, I Schena Annals of Mathematics and Artificial Intelligence 38, 27-46, 2003 | 98 | 2003 |
The effectiveness of data augmentation for detection of gastrointestinal diseases from endoscopical images A Asperti, C Mastronardo arXiv preprint arXiv:1712.03689, 2017 | 81 | 2017 |
A logic for concurrency A Asperti Technical report, Dipartimento di Informatica, Universit a di Pisa, 1987 | 80 | 1987 |
A content based mathematical search engine: Whelp A Asperti, F Guidi, CS Coen, E Tassi, S Zacchiroli Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en …, 2006 | 78 | 2006 |
Paths, computations and labels in the λ-calculus A Asperti, C Laneve Theoretical Computer Science 142 (2), 277-297, 1995 | 74 | 1995 |
HELM and the semantic math-web A Asperti, L Padovani, CS Coen, I Schena International Conference on Theorem Proving in Higher Order Logics, 59-74, 2001 | 72 | 2001 |
Hints in unification A Asperti, W Ricciotti, C Sacerdoti Coen, E Tassi Theorem Proving in Higher Order Logics: 22nd International Conference …, 2009 | 69 | 2009 |
Parallel beta reduction is not elementary recursive A Asperti, HG Mairson Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of …, 1998 | 67 | 1998 |
The Bologna optimal higher-order machine A Asperti, C Giovannetti, A Naletto Journal of Functional Programming 6 (6), 763-810, 1996 | 66 | 1996 |