Damiano Mazza

According to our database, Damiano Mazza authored at least 32 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

On the complexity of normalization for the planar λ-calculus.

Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger

CoRR, 2024

Böhm and Taylor for All!

Aloÿs Dufour, Damiano Mazza

Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2021

Automatic differentiation in PCF.

Damiano Mazza, Michele Pagani

Proc. ACM Program. Lang., 2021

2020

Backpropagation in the simply typed lambda-calculus with linear negation.

Aloïs Brunel, Damiano Mazza, Michele Pagani

Proc. ACM Program. Lang., 2020

Polynomial Time over the Reals with Parsimony.

Emmanuel Hainry, Damiano Mazza, Romain Péchoux

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2019

Intersection types and runtime errors in the pi-calculus.

Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu

Proc. ACM Program. Lang., 2019

2018

Polyadic approximations, fibrations and intersection types.

Damiano Mazza, Luc Pellissier, Pierre Vial

Proc. ACM Program. Lang., 2018

The true concurrency of differential interaction nets.

Damiano Mazza

Math. Struct. Comput. Sci., 2018

2017

Infinitary affine proofs.

Damiano Mazza

Math. Struct. Comput. Sci., 2017

2016

Church Meets Cook and Levin.

Damiano Mazza

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

An abstract approach to stratification in linear logic.

Pierre Boudes, Damiano Mazza, Lorenzo Tortora de Falco

Inf. Comput., 2015

A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic.

Damiano Mazza, Luc Pellissier

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Parsimonious Types and Non-uniform Computation.

Damiano Mazza, Kazushige Terui

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Simple Parsimonious Types and Logarithmic Space.

Damiano Mazza

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

A Strong Distillery.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014

Distilling Abstract Machines (Long Version).

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

CoRR, 2014

Distilling abstract machines.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus.

Damiano Mazza

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

A Core Quantitative Coeffect Calculus.

Aloïs Brunel, Marco Gaboardi, Damiano Mazza, Steve Zdancewic

Proceedings of the Programming Languages and Systems, 2014

2013

Non-linearity as the Metric Completion of Linearity.

Damiano Mazza

Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

A Hierarchy of Expressiveness in Concurrent Interaction Nets.

Andrei Dorman, Damiano Mazza

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Computational Complexity of Interactive Behaviors

Ugo Dal Lago, Tobias Heindel, Damiano Mazza, Daniele Varacca

CoRR, 2012

An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus.

Damiano Mazza

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators.

Damiano Mazza, Neil J. Ross

Proceedings of the Foundations of Software Science and Computational Structures, 2012

2010

Linear logic by levels and bounded time complexity.

Patrick Baillot, Damiano Mazza

Theor. Comput. Sci., 2010

2009

Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

Damiano Mazza

Log. Methods Comput. Sci., 2009

2007

A denotational semantics for the symmetric interaction combinators.

Damiano Mazza

Math. Struct. Comput. Sci., 2007

Edifices and Full Abstraction for the Symmetric Interaction Combinators.

Damiano Mazza

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

The Separation Theorem for Differential Interaction Nets.

Damiano Mazza, Michele Pagani

Proceedings of the Logic for Programming, 2007

2006

Linear logic and polynomial time.

Damiano Mazza

Math. Struct. Comput. Sci., 2006

Observational Equivalence for the Interaction Combinators and Internal Separation.

Damiano Mazza

Proceedings of the Third International Workshop on Term Graph Rewriting, 2006

2005

Multiport Interaction Nets and Concurrency.

Damiano Mazza

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005