Damiano Mazza

According to our database1, Damiano Mazza authored at least 30 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Automatic differentiation in PCF.
Proc. ACM Program. Lang., 2021

2020
Backpropagation in the simply typed lambda-calculus with linear negation.
Proc. ACM Program. Lang., 2020

Polynomial Time over the Reals with Parsimony.
Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2019
Intersection types and runtime errors in the pi-calculus.
Proc. ACM Program. Lang., 2019

2018
Polyadic approximations, fibrations and intersection types.
Proc. ACM Program. Lang., 2018

The true concurrency of differential interaction nets.
Math. Struct. Comput. Sci., 2018

2017
Infinitary affine proofs.
Math. Struct. Comput. Sci., 2017

2016
Church Meets Cook and Levin.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
An abstract approach to stratification in linear logic.
Inf. Comput., 2015

A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Parsimonious Types and Non-uniform Computation.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Simple Parsimonious Types and Logarithmic Space.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

A Strong Distillery.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
Distilling Abstract Machines (Long Version).
CoRR, 2014

Distilling abstract machines.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

A Core Quantitative Coeffect Calculus.
Proceedings of the Programming Languages and Systems, 2014

2013
Non-linearity as the Metric Completion of Linearity.
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

A Hierarchy of Expressiveness in Concurrent Interaction Nets.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Computational Complexity of Interactive Behaviors
CoRR, 2012

An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2010
Linear logic by levels and bounded time complexity.
Theor. Comput. Sci., 2010

2009
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
Log. Methods Comput. Sci., 2009

2007
A denotational semantics for the symmetric interaction combinators.
Math. Struct. Comput. Sci., 2007

Observational Equivalence for the Interaction Combinators and Internal Separation.
Electron. Notes Theor. Comput. Sci., 2007

Edifices and Full Abstraction for the Symmetric Interaction Combinators.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

The Separation Theorem for Differential Interaction Nets.
Proceedings of the Logic for Programming, 2007

2006
Linear logic and polynomial time.
Math. Struct. Comput. Sci., 2006

2005
Multiport Interaction Nets and Concurrency.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005


  Loading...