default search action
Damiano Mazza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Aloÿs Dufour, Damiano Mazza:
Böhm and Taylor for All! FSCD 2024: 29:1-29:20 - [i8]Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger:
On the complexity of normalization for the planar λ-calculus. CoRR abs/2404.05276 (2024) - 2021
- [j11]Damiano Mazza, Michele Pagani
:
Automatic differentiation in PCF. Proc. ACM Program. Lang. 5(POPL): 1-27 (2021) - 2020
- [j10]Aloïs Brunel, Damiano Mazza, Michele Pagani:
Backpropagation in the simply typed lambda-calculus with linear negation. Proc. ACM Program. Lang. 4(POPL): 64:1-64:27 (2020) - [c17]Emmanuel Hainry, Damiano Mazza, Romain Péchoux:
Polynomial Time over the Reals with Parsimony. FLOPS 2020: 50-65 - [i7]Damiano Mazza, Michele Pagani:
Automatic Differentiation in PCF. CoRR abs/2011.03335 (2020)
2010 – 2019
- 2019
- [j9]Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu:
Intersection types and runtime errors in the pi-calculus. Proc. ACM Program. Lang. 3(POPL): 7:1-7:29 (2019) - [i6]Aloïs Brunel, Damiano Mazza, Michele Pagani:
Backpropagation in the Simply Typed Lambda-calculus with Linear Negation. CoRR abs/1909.13768 (2019) - 2018
- [j8]Damiano Mazza:
The true concurrency of differential interaction nets. Math. Struct. Comput. Sci. 28(7): 1097-1125 (2018) - [j7]Damiano Mazza, Luc Pellissier
Polyadic approximations, fibrations and intersection types. Proc. ACM Program. Lang. 2(POPL): 6:1-6:28 (2018) - 2017
- [j6]Damiano Mazza:
Infinitary affine proofs. Math. Struct. Comput. Sci. 27(5): 581-602 (2017) - 2016
- [c16]Damiano Mazza:
Church Meets Cook and Levin. LICS 2016: 827-836 - 2015
- [j5]Pierre Boudes
An abstract approach to stratification in linear logic. Inf. Comput. 241: 32-61 (2015) - [c15]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. APLAS 2015: 231-250 - [c14]Damiano Mazza:
Simple Parsimonious Types and Logarithmic Space. CSL 2015: 24-40 - [c13]Damiano Mazza, Kazushige Terui:
Parsimonious Types and Non-uniform Computation. ICALP (2) 2015: 350-361 - [c12]Damiano Mazza, Luc Pellissier
A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic. ICTAC 2015: 144-161 - [i5]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. CoRR abs/1509.00996 (2015) - 2014
- [c11]Aloïs Brunel, Marco Gaboardi, Damiano Mazza, Steve Zdancewic:
A Core Quantitative Coeffect Calculus. ESOP 2014: 351-370 - [c10]Damiano Mazza:
Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus. ICALP (2) 2014: 305-317 - [c9]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling abstract machines. ICFP 2014: 363-376 - [i4]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling Abstract Machines (Long Version). CoRR abs/1406.2370 (2014) - 2013
- [c8]Andrei Dorman, Damiano Mazza:
A Hierarchy of Expressiveness in Concurrent Interaction Nets. CONCUR 2013: 197-211 - [c7]Damiano Mazza:
Non-linearity as the Metric Completion of Linearity. TLCA 2013: 3-14 - 2012
- [c6]Damiano Mazza, Neil J. Ross
Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators. FoSSaCS 2012: 316-330 - [c5]Damiano Mazza:
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus. LICS 2012: 471-480 - [i3]Pierre Boudes
An Abstract Approach to Stratification in Linear Logic. CoRR abs/1206.6504 (2012) - [i2]Ugo Dal Lago, Tobias Heindel, Damiano Mazza, Daniele Varacca:
Computational Complexity of Interactive Behaviors. CoRR abs/1209.0663 (2012) - 2010
- [j4]Patrick Baillot, Damiano Mazza:
Linear logic by levels and bounded time complexity. Theor. Comput. Sci. 411(2): 470-503 (2010)
2000 – 2009
- 2009
- [j3]Damiano Mazza:
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators. Log. Methods Comput. Sci. 5(4) (2009) - 2008
- [i1]Patrick Baillot, Damiano Mazza:
Linear Logic by Levels and Bounded Time Complexity. CoRR abs/0801.1253 (2008) - 2007
- [j2]Damiano Mazza:
A denotational semantics for the symmetric interaction combinators. Math. Struct. Comput. Sci. 17(3): 527-562 (2007) - [c4]Damiano Mazza, Michele Pagani:
The Separation Theorem for Differential Interaction Nets. LPAR 2007: 393-407 - [c3]Damiano Mazza:
Edifices and Full Abstraction for the Symmetric Interaction Combinators. TLCA 2007: 305-320 - 2006
- [j1]Damiano Mazza:
Linear logic and polynomial time. Math. Struct. Comput. Sci. 16(6): 947-988 (2006) - [c2]Damiano Mazza:
Observational Equivalence for the Interaction Combinators and Internal Separation. TERMGRAPH@ETAPS 2006: 113-137 - 2005
- [c1]Damiano Mazza:
Multiport Interaction Nets and Concurrency. CONCUR 2005: 21-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: