Multiport Interaction Nets and Concurrency. - Damiano Mazza (CONCUR, 2005)

Observational Equivalence for the Interaction Combinators and Internal Separation. - Damiano Mazza (TERMGRAPH@ETAPS, 2006)

Linear logic and polynomial time. - Damiano Mazza (Math. Struct. Comput. Sci., 2006)

The Separation Theorem for Differential Interaction Nets. - Damiano Mazza; Michele Pagani (LPAR, 2007)

Edifices and Full Abstraction for the Symmetric Interaction Combinators. - Damiano Mazza (TLCA, 2007)

A denotational semantics for the symmetric interaction combinators. - Damiano Mazza (Math. Struct. Comput. Sci., 2007)

Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators - Damiano Mazza (Log. Methods Comput. Sci., 2009)

Linear logic by levels and bounded time complexity. - Patrick Baillot; Damiano Mazza (Theor. Comput. Sci., 2010)

Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators. - Damiano Mazza; Neil J. Ross (FoSSaCS, 2012)

An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus. - Damiano Mazza (LICS, 2012)

Computational Complexity of Interactive Behaviors - Ugo Dal Lago; Tobias Heindel; Damiano Mazza; Daniele Varacca (CoRR, 2012)

A Hierarchy of Expressiveness in Concurrent Interaction Nets. - Andrei Dorman; Damiano Mazza (CONCUR, 2013)

Non-linearity as the Metric Completion of Linearity. - Damiano Mazza (TLCA, 2013)

A Core Quantitative Coeffect Calculus. - Aloïs Brunel; Marco Gaboardi; Damiano Mazza; Steve Zdancewic (ESOP, 2014)

Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus. - Damiano Mazza (ICALP (2), 2014)

Distilling abstract machines. - Beniamino Accattoli; Pablo Barenbaum; Damiano Mazza (ICFP, 2014)

Distilling Abstract Machines (Long Version). - Beniamino Accattoli; Pablo Barenbaum; Damiano Mazza (CoRR, 2014)

A Strong Distillery. - Beniamino Accattoli; Pablo Barenbaum; Damiano Mazza (APLAS, 2015)

Simple Parsimonious Types and Logarithmic Space. - Damiano Mazza (CSL, 2015)

Parsimonious Types and Non-uniform Computation. - Damiano Mazza; Kazushige Terui (ICALP (2), 2015)

A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic. - Damiano Mazza; Luc Pellissier (ICTAC, 2015)

An abstract approach to stratification in linear logic. - Pierre Boudes; Damiano Mazza; Lorenzo Tortora de Falco (Inf. Comput., 2015)

Church Meets Cook and Levin. - Damiano Mazza (LICS, 2016)

Infinitary affine proofs. - Damiano Mazza (Math. Struct. Comput. Sci., 2017)

The true concurrency of differential interaction nets. - Damiano Mazza (Math. Struct. Comput. Sci., 2018)

Polyadic approximations, fibrations and intersection types. - Damiano Mazza; Luc Pellissier; Pierre Vial (Proc. ACM Program. Lang., 2018)

Intersection types and runtime errors in the pi-calculus. - Ugo Dal Lago; Marc de Visme; Damiano Mazza; Akira Yoshimizu (Proc. ACM Program. Lang., 2019)

Polynomial Time over the Reals with Parsimony. - Emmanuel Hainry; Damiano Mazza; Romain Péchoux (FLOPS, 2020)

Backpropagation in the simply typed lambda-calculus with linear negation. - Aloïs Brunel; Damiano Mazza; Michele Pagani (Proc. ACM Program. Lang., 2020)

Automatic differentiation in PCF. - Damiano Mazza; Michele Pagani (Proc. ACM Program. Lang., 2021)

Böhm and Taylor for All! - Aloÿs Dufour; Damiano Mazza (FSCD, 2024)

On the complexity of normalization for the planar λ-calculus. - Anupam Das; Damiano Mazza; Lê Thành Dung Nguyên; Noam Zeilberger (CoRR, 2024)

Unifying Boolean and Algebraic Descriptive Complexity. - Baptiste Chanus; Damiano Mazza; Morgan Rogers (FSCD, 2025)