Verified email at - Homepage
TitleCited byYear
Categories, types, and structures
A Asperti, G Longo
MIT Pr., 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
The optimal implementation of functional programming languages
A Asperti, S Guerrini
Cambridge University Press, 1998
Intuitionistic light affine logic
A Asperti, L Roversi
ACM Transactions on Computational Logic (TOCL) 3 (1), 137-175, 2002
Mobile petri nets
A Asperti, N Busi
Mathematical Structures in Computer Science 19 (6), 1265-1278, 2009
Light affine logic
A Asperti
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998
User interaction with the Matita proof assistant
A Asperti, CS Coen, E Tassi, S Zacchiroli
Journal of Automated Reasoning 39 (2), 109-139, 2007
Interaction Systems I: The theory of optimal reductions
A Asperti, C Laneve
Mathematical Structures in Computer Science 11, 1-48, 1993
Mathematical knowledge management in HELM
A Asperti, L Padovani, CS Coen, F Guidi, I Schena
Annals of Mathematics and Artificial Intelligence 38 (1-3), 27-46, 2003
The Matita interactive theorem prover
A Asperti, W Ricciotti, CS Coen, E Tassi
International Conference on Automated Deduction, 64-69, 2011
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
A logic for concurrency
A Asperti
Technical report, Dipartimento di Informatica, Universit a di Pisa, 1987
A content based mathematical search engine: Whelp
A Asperti, F Guidi, CS Coen, E Tassi, S Zacchiroli
International Workshop on Types for Proofs and Programs, 17-32, 2004
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
Paths, computations and labels in the λ-calculus
A Asperti, C Laneve
Theoretical Computer Science 142 (2), 277-297, 1995
The Bologna optimal higher-order machine
A Asperti, C Giovannetti, A Naletto
Journal of Functional Programming 6 (6), 763-810, 1996
Parallel beta reduction is not elementary recursive
A Asperti, HG Mairson
Information and Computation 170 (1), 49-80, 2001
Linear logic, comonads and optimal reductions
A Asperti
Fundamenta Informaticae 22 (1, 2), 3-22, 1995
Mathematical service matching using Description Logic and OWL
O Caprotti, M Dewar, D Turi
International Conference on Mathematical Knowledge Management, 73-87, 2004
Implicative formulae in the proofs of computations' analogy
A Asperti, GL Ferrari, R Gorrieri
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of …, 1989
The system can't perform the operation now. Try again later.
Articles 1–20