Damiano Mazza

发表

The Separation Theorem for Differential Interaction Nets

Damiano Mazza, Michele Pagani, Michele Pagani, 2007, LPAR.

Distilling abstract machines

Damiano Mazza, Beniamino Accattoli, Pablo Barenbaum, 2014, ICFP.

Multiport Interaction Nets and Concurrency

Damiano Mazza, Damiano Mazza, 2005, CONCUR.

Non-linearity as the Metric Completion of Linearity

Damiano Mazza, 2013, TLCA.

A Core Quantitative Coeffect Calculus

Marco Gaboardi, Damiano Mazza, Steve Zdancewic, 2014, ESOP.

Observational Equivalence for the Interaction Combinators and Internal Separation

Damiano Mazza, 2007, Electron. Notes Theor. Comput. Sci..

Church Meets Cook and Levin

Damiano Mazza, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Polynomial Time over the Reals with Parsimony

Damiano Mazza, Emmanuel Hainry, Romain Péchoux, 2020, FLOPS.

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

Damiano Mazza, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

Infinitary affine proofs

Damiano Mazza, 2017, Math. Struct. Comput. Sci..

An abstract approach to stratification in linear logic pdf

Damiano Mazza, Lorenzo Tortora de Falco, Pierre Boudes, 2012, Inf. Comput..

Linear logic and polynomial time

Damiano Mazza, 2006, Math. Struct. Comput. Sci..

Polyadic Approximations and Intersection Types: Invited Presentation at the Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems

Damiano Mazza, 2019 .

Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators

Damiano Mazza, 2009, Log. Methods Comput. Sci..

A Strong Distillery pdf

Damiano Mazza, Beniamino Accattoli, Pablo Barenbaum, 2015, APLAS.

Edifices and Full Abstraction for the Symmetric Interaction Combinators

Damiano Mazza, 2007, TLCA.

Linear logic by levels and bounded time complexity

Damiano Mazza, Patrick Baillot, Damiano Mazza, 2008, Theor. Comput. Sci..

Backpropagation in the simply typed lambda-calculus with linear negation

Damiano Mazza, Michele Pagani, Alois Brunel, 2020, Proc. ACM Program. Lang..

The true concurrency of differential interaction nets

Damiano Mazza, Damiano Mazza, 2016, Mathematical Structures in Computer Science.

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

Damiano Mazza, 2014, ICALP.

Interaction nets : semantics and concurrent extensions

Damiano Mazza, 2006 .

Polyadic approximations, fibrations and intersection types

Damiano Mazza, Pierre Vial, Luc Pellissier, 2017, Proc. ACM Program. Lang..

Multiport Interaction Nets and Concurrency (Extended Abstract)

Damiano Mazza, 2005 .

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

Damiano Mazza, Luc Pellissier, 2015, ICTAC.

Automatic differentiation in PCF

Damiano Mazza, Michele Pagani, Michele Pagani, 2020, Proc. ACM Program. Lang..

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

Damiano Mazza, Neil J. Ross, 2012, FoSSaCS.

Intersection types and runtime errors in the pi-calculus

Ugo Dal Lago, Damiano Mazza, Marc de Visme, 2019, Proc. ACM Program. Lang..

Distilling Abstract Machines (Long Version) pdf

Damiano Mazza, Beniamino Accattoli, Pablo Barenbaum, 2014, ArXiv.

A denotational semantics for the symmetric interaction combinators

Damiano Mazza, 2007, Math. Struct. Comput. Sci..

Parsimonious Types and Non-uniform Computation

Kazushige Terui, Damiano Mazza, 2015, ICALP.

Simple Parsimonious Types and Logarithmic Space

Damiano Mazza, 2015, CSL.

Computational Complexity of Interactive Behaviors pdf

Daniele Varacca, Ugo Dal Lago, Damiano Mazza, 2012, ArXiv.

A Hierarchy of Expressiveness in Concurrent Interaction Nets

Damiano Mazza, Andrei Dorman, Damiano Mazza, 2013, CONCUR.

An Abstract Approach to Stratication in Linear Logic

Damiano Mazza, Lorenzo Tortora de Falco, Pierre Boudes, 2013 .