Andrea Asperti

From MaRDI portal
Person:287278

Available identifiers

zbMath Open asperti.andreaWikidataQ57066096 ScholiaQ57066096MaRDI QIDQ287278

List of research outcomes

PublicationDate of PublicationType
Effective applicative structures2022-12-16Paper
Paths, computations and labels in the λ-calculus2022-12-09Paper
δο!∈=1 Optimizing optimal λ-calculus implementations2022-12-09Paper
Optimal reductions in interaction systems2022-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49647072021-03-03Paper
https://portal.mardi4nfdi.de/entity/Q51952482019-09-18Paper
Matita Tutorial2019-09-18Paper
On the dynamics of sharing graphs2018-07-04Paper
The Cost of Usage in the ?-Calculus2017-07-03Paper
Intuitionistic Light Affine Logic2017-06-13Paper
Reverse complexity2016-05-26Paper
A formalization of multi-tape Turing machines2015-10-12Paper
Computational Complexity Via Finite Types2015-09-17Paper
(Optimal) duplication is not elementary recursive2015-03-17Paper
A Formal Proof of Borodin-Trakhtenbrot’s Gap Theorem2015-01-13Paper
The intensional content of Rice's theorem2014-09-12Paper
An Interactive Driver for Goal-directed Proof Strategies2014-06-27Paper
https://portal.mardi4nfdi.de/entity/Q53974842014-02-21Paper
A Machine-Checked Proof of the Odd Order Theorem2013-08-07Paper
Rating Disambiguation Errors2013-04-19Paper
Formal metatheory of programming languages in the Matita interactive theorem prover2013-04-17Paper
Formalizing Turing Machines2012-09-21Paper
A Compact Proof of Decidability for Regular Expression Equivalence2012-09-20Paper
Proof, Message and Certificate2012-09-07Paper
A Web Interface for Matita2012-09-07Paper
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions2012-04-03Paper
Zen and the art of formalisation2011-10-21Paper
The Matita Interactive Theorem Prover2011-07-29Paper
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita2011-07-29Paper
Some Considerations on the Usability of Interactive Provers2010-08-24Paper
Smart Matching2010-08-24Paper
A compact kernel for the calculus of inductive constructions2009-11-23Paper
Social processes, program verification and all that2009-11-11Paper
Hints in Unification2009-10-20Paper
https://portal.mardi4nfdi.de/entity/Q34976212009-07-27Paper
About the Formalization of Some Results by Chebyshev in Number Theory2009-07-02Paper
Crafting a Proof Assistant2009-03-10Paper
https://portal.mardi4nfdi.de/entity/Q54602542008-05-05Paper
User interaction with the Matita proof assistant2007-12-03Paper
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case2007-11-28Paper
Mathematical Knowledge Management2007-02-12Paper
Types for Proofs and Programs2006-11-13Paper
Mathematical Knowledge Management2005-08-26Paper
https://portal.mardi4nfdi.de/entity/Q30248182005-07-04Paper
(Optimal) duplication is not elementary recursive2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q44743492004-07-09Paper
Mathematical knowledge management in HELM2003-06-09Paper
https://portal.mardi4nfdi.de/entity/Q47906512003-02-04Paper
Parallel beta reduction is not elementary recursive2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27679192002-02-14Paper
https://portal.mardi4nfdi.de/entity/Q45011352000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44907372000-07-20Paper
A sufficient condition for completability of partial combinatory algebras1999-08-17Paper
Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations1998-11-26Paper
The bologna optimal higher-order machine1997-06-04Paper
Paths, computations and labels in the \(\lambda\)-calculus1997-02-28Paper
Interaction systems II: The practice of optimal reductions1997-02-27Paper
Causal dependencies in multiplicative linear logic with MIX1996-12-05Paper
https://portal.mardi4nfdi.de/entity/Q43278281995-08-10Paper
A categorical understanding of environment machines1995-05-01Paper
Interaction Systems I: The theory of optimal reductions1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q40295831993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q39996031993-01-23Paper
Categorical models of polymorphism1992-09-27Paper
Stability and computability in coherent domains1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30263321986-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andrea Asperti