Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. - Andrea Asperti; Giuseppe Longo (CAAP, 1986)

Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. - Andrea Asperti; Simone Martini 001 (ICLP, 1989)

Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus. - Andrea Asperti (PLILP, 1990)

Implicative Formulae in the "Proofs as Computations" Analogy. - Andrea Asperti; Gian-Luigi Ferrari 002; Roberto Gorrieri (POPL, 1990)

Stability and Computability in Coherent Domains - Andrea Asperti (Inf. Comput., 1990)

Categories, types and structures - an introduction to category theory for the working computer scientist. - Andrea Asperti; Giuseppe Longo (MIT Press, 1991)

A Categorial Model for Logic Programs: Indexed Monoidal Categories. - Andrea Corradini 001; Andrea Asperti (REX Workshop, 1992)

A Categorical Understanding of Environment Machines. - Andrea Asperti (J. Funct. Program., 1992)

Categorical Models of Polymorphism - Andrea Asperti; Simone Martini 001 (Inf. Comput., 1992)

Interaction Systems. - Andrea Asperti; Cosimo Laneve (HOA, 1993)

Optimal Reductions in Interaction Systems. - Andrea Asperti; Cosimo Laneve (TAPSOFT, 1993)

Category Theory: Basic notions and general philosophy. - Andrea Asperti (JFPLC, 1994)

Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. - Andrea Asperti; Giovanna M. Dore (LFCS, 1994)

Paths in the lambda-calculus - Andrea Asperti; Vincent Danos; Cosimo Laneve; Laurent Regnier (LICS, 1994)

The Family Relation in Interaction Systems. - Andrea Asperti; Cosimo Laneve (TACS, 1994)

Interaction Systems I: The Theory of Optimal Reductions. - Andrea Asperti; Cosimo Laneve (Math. Struct. Comput. Sci., 1994)

Effective Applicative Structures. - Andrea Asperti; Agata Ciabattoni (Category Theory and Computer Science, 1995)

deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. - Andrea Asperti (RTA, 1995)

Comparing Lambda-calculus translations in Sharing Graphs. - Andrea Asperti; Cosimo Laneve (TLCA, 1995)

Linear Logic, Comonads and Optimal Reduction. - Andrea Asperti (Fundam. Informaticae, 1995)

Causal Dependencies in Multiplicative Linear Logic with MIX. - Andrea Asperti (Math. Struct. Comput. Sci., 1995)

Paths, Computations and Labels in the lambda-Calculus. - Andrea Asperti; Cosimo Laneve (Theor. Comput. Sci., 1995)

On the Complexity of Beta-Reduction. - Andrea Asperti (POPL, 1996)

The Bologna Optimal Higher-Order Machine. - Andrea Asperti; Cecilia Giovanetti; Andrea Naletto (J. Funct. Program., 1996)

Interaction Systems II: The Practice of Optimal Reductions. - Andrea Asperti; Cosimo Laneve (Theor. Comput. Sci., 1996)

On the Dynamics of Sharing Graphs. - Andrea Asperti; Cosimo Laneve (ICALP, 1997)

Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations. - Andrea Asperti; Juliusz Chroboczek (Appl. Algebra Eng. Commun. Comput., 1997)

A Sufficient Condition for Completability of Partial Combinatory Algebras. - Andrea Asperti; Agata Ciabattoni (J. Symb. Log., 1997)

The optimal implementation of functional programming languages. - Andrea Asperti; Stefano Guerrini (Cambridge University Press, 1998)

Light Affine Logic. - Andrea Asperti (LICS, 1998)

Optimal Reduction of Functional Expressions. - Andrea Asperti (PLILP/ALP, 1998)

Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) - Andrea Asperti; Luca Roversi (CoRR, 2000)

XML, Stylesheets and the Re-mathematization of Formal Content. - Andrea Asperti; Luca Padovani; Claudio Sacerdoti Coen; Irene Schena (Extreme Markup Languages®, 2001)

HELM and the Semantic Math-Web. - Andrea Asperti; Luca Padovani; Claudio Sacerdoti Coen; Irene Schena (TPHOLs, 2001)

Parallel Beta Reduction Is Not Elementary Recursive. - Andrea Asperti; Harry G. Mairson (Inf. Comput., 2001)

MOWGLI - An Approach to Machine-Understandable Representation of the Mathematical Information in Digital Documents. - Andrea Asperti; Bernd Wegner (Electronic Information and Communication in Mathematics, 2002)

Intuitionistic Light Affine Logic. - Andrea Asperti; Luca Roversi (ACM Trans. Comput. Log., 2002)

Mathematical Knowledge Management in HELM. - Andrea Asperti; Luca Padovani; Claudio Sacerdoti Coen; Ferruccio Guidi; Irene Schena (Ann. Math. Artif. Intell., 2003)

Efficient Retrieval of Mathematical Statements. - Andrea Asperti; Matteo Selmi (MKM, 2004)

A Content Based Mathematical Search Engine: Whelp. - Andrea Asperti; Ferruccio Guidi; Claudio Sacerdoti Coen; Enrico Tassi; Stefano Zacchiroli (TYPES, 2004)

(Optimal) duplication is not elementary recursive. - Andrea Asperti; Paolo Coppola 001; Simone Martini 001 (Inf. Comput., 2004)

An Interactive Algebra Course with Formalised Proofs and Definitions. - Andrea Asperti; Herman Geuvers; Iris Loeb; Lionel Elie Mamane; Claudio Sacerdoti Coen (MKM, 2005)

Crafting a Proof Assistant. - Andrea Asperti; Claudio Sacerdoti Coen; Enrico Tassi; Stefano Zacchiroli (TYPES, 2006)

Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. - Andrea Asperti; Enrico Tassi (Calculemus/MKM, 2007)

User Interaction with the Matita Proof Assistant. - Andrea Asperti; Claudio Sacerdoti Coen; Enrico Tassi; Stefano Zacchiroli (J. Autom. Reason., 2007)

The intensional content of Rice's theorem. - Andrea Asperti (POPL, 2008)

About the Formalization of Some Results by Chebyshev in Number Theory. - Andrea Asperti; Wilmer Ricciotti (TYPES, 2008)

An Interactive Driver for Goal-directed Proof Strategies. - Andrea Asperti; Enrico Tassi (UITP@TPHOLs, 2008)

A Page in Number Theory. - Andrea Asperti; Cristian Armentano (J. Formaliz. Reason., 2008)

Hints in Unification. - Andrea Asperti; Wilmer Ricciotti; Claudio Sacerdoti Coen; Enrico Tassi (TPHOLs, 2009)

Superposition as a logical glue - Andrea Asperti; Enrico Tassi (TYPES, 2009)

Preface. - Roberto M. Amadio; Giuseppe Castagna; Andrea Asperti (Inf. Comput., 2009)

Mobile Petri nets. - Andrea Asperti; Nadia Busi (Math. Struct. Comput. Sci., 2009)

Social processes, program verification and all that. - Andrea Asperti; Herman Geuvers; Raja Natarajan (Math. Struct. Comput. Sci., 2009)

Some Considerations on the Usability of Interactive Provers. - Andrea Asperti; Claudio Sacerdoti Coen (AISC/MKM/Calculemus, 2010)

Smart Matching. - Andrea Asperti; Enrico Tassi (AISC/MKM/Calculemus, 2010)

Regular Expressions, au point - Andrea Asperti; Claudio Sacerdoti Coen; Enrico Tassi (CoRR, 2010)

The Matita Interactive Theorem Prover. - Andrea Asperti; Wilmer Ricciotti; Claudio Sacerdoti Coen; Enrico Tassi (CADE, 2011)

Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. - Andrea Asperti; Maria Emilia Maietti; Claudio Sacerdoti Coen; Giovanni Sambin; Silvio Valentini (Calculemus/MKM, 2011)

Zen and the art of formalisation. - Andrea Asperti; Jeremy Avigad (Math. Struct. Comput. Sci., 2011)

Certified Complexity. - R. Armadio; Andrea Asperti; Nicholas Ayache; Brian Campbell 001; Dominic P. Mulligan; Randy Pollack; Yann Régis-Gianas; Claudio Sacerdoti Coen; Ian Stark (FET, 2011)

Proof, Message and Certificate. - Andrea Asperti (AISC/MKM/Calculemus, 2012)

A Web Interface for Matita. - Andrea Asperti; Wilmer Ricciotti (AISC/MKM/Calculemus, 2012)

Rating Disambiguation Errors. - Andrea Asperti; Wilmer Ricciotti (CPP, 2012)

A Compact Proof of Decidability for Regular Expression Equivalence. - Andrea Asperti (ITP, 2012)

Type systems for dummies. - Andrea Asperti; Ferruccio Guidi (TLDI, 2012)

Formalizing Turing Machines. - Andrea Asperti; Wilmer Ricciotti (WoLLIC, 2012)

A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions - Andrea Asperti; Wilmer Ricciotti; Claudio Sacerdoti Coen; Enrico Tassi (Log. Methods Comput. Sci., 2012)

Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover. - Andrea Asperti; Wilmer Ricciotti; Claudio Sacerdoti Coen; Enrico Tassi (J. Autom. Reason., 2012)

A proof of Bertrand's postulate. - Andrea Asperti; Wilmer Ricciotti (J. Formaliz. Reason., 2012)

A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem. - Andrea Asperti (CPP, 2013)

A Machine-Checked Proof of the Odd Order Theorem. - Georges Gonthier; Andrea Asperti; Jeremy Avigad; Yves Bertot; Cyril Cohen; François Garillot; Stéphane Le Roux 001; Assia Mahboubi; Russell O'Connor; Sidi Ould Biha; Ioana Pasca; Laurence Rideau; et al. (ITP, 2013)

The Cost of Usage in the Lambda-Calculus. - Andrea Asperti; Jean-Jacques Lévy (LICS, 2013)

Matita Tutorial. - Andrea Asperti; Wilmer Ricciotti; Claudio Sacerdoti Coen (J. Formaliz. Reason., 2014)

The Speedup Theorem in a Primitive Recursive Framework. - Andrea Asperti (CPP, 2015)

Reverse Complexity. - Andrea Asperti (J. Autom. Reason., 2015)

A formalization of multi-tape Turing machines. - Andrea Asperti; Wilmer Ricciotti (Theor. Comput. Sci., 2015)

Computational Complexity Via Finite Types. - Andrea Asperti (ACM Trans. Comput. Log., 2015)

Automatic verification and interactive theorem proving. - Andrea Asperti (CoRR, 2017)

About the efficient reduction of lambda terms. - Andrea Asperti (CoRR, 2017)

The Effectiveness of Data Augmentation for Detection of Gastrointestinal Diseases from Endoscopical Images. - Andrea Asperti; Claudio Mastronardo (BIOIMAGING, 2018)

Crawling in Rogue's Dungeons with (Partitioned) A3C. - Andrea Asperti; Daniele Cortesi; Francesco Sovrano (LOD, 2018)

Sparsity in Variational Autoencoders. - Andrea Asperti (CoRR, 2018)

About Generative Aspects of Variational Autoencoders. - Andrea Asperti (LOD, 2019)

Variance Loss in Variational Autoencoders. - Andrea Asperti (LOD (1), 2020)

Balancing Reconstruction Error and Kullback-Leibler Divergence in Variational Autoencoders. - Andrea Asperti; Matteo Trentin (IEEE Access, 2020)

Crawling in Rogue's Dungeons With Deep Reinforcement Techniques. - Andrea Asperti; Daniele Cortesi; Carlo De Pieri; Gianmaria Pedrini; Francesco Sovrano (IEEE Trans. Games, 2020)

Dissecting FLOPs Along Input Dimensions for GreenAI Cost Estimations. - Andrea Asperti; Davide Evangelista; Moreno Marzolla (LOD, 2021)

A survey on Variational Autoencoders from a GreenAI perspective. - Andrea Asperti; Davide Evangelista; Elena Loli Piccolomini (CoRR, 2021)

Syllabification of the Divine Comedy. - Andrea Asperti; Stefano Dal Bianco (ACM Journal on Computing and Cultural Heritage, 2021)

A Survey on Variational Autoencoders from a Green AI Perspective. - Andrea Asperti; Davide Evangelista; Elena Loli Piccolomini (SN Comput. Sci., 2021)

MicroRacer: A Didactic Environment for Deep Reinforcement Learning. - Andrea Asperti; Marco Del Brutto (LOD (1), 2022)

Enhancing Variational Generation Through Self-Decomposition. - Andrea Asperti; Laura Bugo; Daniele Filippini (IEEE Access, 2022)

Head Rotation in Denoising Diffusion Models. - Andrea Asperti; Gabriele Colasuonno; Antonio Guerra (CoRR, 2023)

Comparing the latent space of generative models. - Andrea Asperti; Valerio Tonelli (Neural Comput. Appl., 2023)

Deep Learning for Head Pose Estimation: A Survey. - Andrea Asperti; Daniele Filippini (SN Comput. Sci., 2023)

Image embedding for denoising generative models. - Andrea Asperti; Davide Evangelista; Samuele Marro; Fabio Merizzi (Artif. Intell. Rev., 2023)

A Notion of Complexity for Theory of Mind via Discrete World Models. - X. Angelo Huang; Emanuele La Malfa; Samuele Marro; Andrea Asperti; Anthony G. Cohn 001; Michael J. Wooldridge (EMNLP (Findings), 2024)

Deep Learning for Sea Surface Temperature Reconstruction under Cloud Occlusion. - Andrea Asperti; Ali Aydogdu; Emanuela Clementi; Angelo Greco; Lorenzo Mentaschi; Fabio Merizzi; Pietro Miraglio; Paolo Oddo; Nadia Pinardi; Alessandro Testa (CoRR, 2024)

A Generative Approach to Person Reidentification. - Andrea Asperti; Salvatore Fiorilla; Lorenzo Orsini (Sensors, 2024)

Wind speed super-resolution and validation: from ERA5 to CERRA via diffusion models. - Fabio Merizzi; Andrea Asperti; Stefano Colamonaco (Neural Comput. Appl., 2024)

Precipitation nowcasting with generative diffusion models. - Andrea Asperti; Fabio Merizzi; Alberto Paparella; Giorgio Pedrazzi; Matteo Angelinelli; Stefano Colamonaco (Appl. Intell., 2025)

A review of recent techniques for person re-identification. - Andrea Asperti; Salvatore Fiorilla; Simone Nardi; Lorenzo Orsini (Mach. Vis. Appl., 2025)

A Critical Assessment of Modern Generative Models' Ability to Replicate Artistic Styles. - Andrea Asperti; Franky George; Tiberio Marras; Razvan Ciprian Stricescu; Fabio Zanotti (CoRR, 2025)

Does CLIP perceive art the same way we do? - Andrea Asperti; Leonardo Dessì; Maria Chiara Tonetti; Nico Wu (CoRR, 2025)

Thinking Machines: Mathematical Reasoning in the Age of LLMs. - Andrea Asperti; Alberto Naibo; Claudio Sacerdoti Coen (CoRR, 2025)