List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Böhm and Taylor for all! | 2026-01-14 | Paper |
| Polynomial time over the reals with parsimony | 2021-07-06 | Paper |
| The true concurrency of differential interaction nets Mathematical Structures in Computer Science | 2018-08-07 | Paper |
| Church meets Cook and Levin Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Simple parsimonious types and logarithmic space | 2017-08-31 | Paper |
| Infinitary affine proofs Mathematical Structures in Computer Science | 2017-06-14 | Paper |
| An infinitary affine lambda-calculus isomorphic to the full lambda-calculus 2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Distilling abstract machines Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
| A functorial bridge between the infinitary affine lambda-calculus and linear logic Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
| A strong distillery Programming Languages and Systems | 2016-01-08 | Paper |
| Parsimonious types and non-uniform computation Automata, Languages, and Programming | 2015-11-04 | Paper |
| An abstract approach to stratification in linear logic Information and Computation | 2015-05-04 | Paper |
| Non-uniform polytime computation in the infinitary affine lambda-calculus Automata, Languages, and Programming | 2014-07-01 | Paper |
| A core quantitative coeffect calculus Programming Languages and Systems | 2014-04-16 | Paper |
| Observational equivalence for the interaction combinators and internal separation Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
| A hierarchy of expressiveness in concurrent interaction nets CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
| Non-linearity as the metric completion of linearity Lecture Notes in Computer Science | 2013-06-28 | Paper |
| Full abstraction for set-based models of the symmetric interaction combinators Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
| Observational equivalence and full abstraction in the symmetric interaction combinators Logical Methods in Computer Science | 2010-01-28 | Paper |
| Linear logic by levels and bounded time complexity Theoretical Computer Science | 2009-12-15 | Paper |
| Edifices and Full Abstraction for the Symmetric Interaction Combinators Lecture Notes in Computer Science | 2009-03-10 | Paper |
| The Separation Theorem for Differential Interaction Nets Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
| A denotational semantics for the symmetric interaction combinators Mathematical Structures in Computer Science | 2007-09-26 | Paper |
| Linear logic and polynomial time Mathematical Structures in Computer Science | 2007-02-07 | Paper |
| CONCUR 2005 – Concurrency Theory Lecture Notes in Computer Science | 2006-11-01 | Paper |
Research outcomes over time
This page was built for person: Damiano Mazza
