default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Pagani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Michele Pagani:
Some Advances in Linear Logic. University Paris Nord (Paris 13), France, 2013
Journal Articles
- 2021
- [j12]Damiano Mazza, Michele Pagani
:
Automatic differentiation in PCF. Proc. ACM Program. Lang. 5(POPL): 1-27 (2021) - 2020
- [j11]Axel Kerinec, Giulio Manzonetto, Michele Pagani:
Revisiting Call-by-value Böhm trees in light of their Taylor expansion. Log. Methods Comput. Sci. 16(3) (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) - 2019
- [j9]Giulio Manzonetto, Michele Pagani, Simona Ronchi Della Rocca:
New Semantical Insights Into Call-by-Value λ-Calculus. Fundam. Informaticae 170(1-3): 241-265 (2019) - 2018
- [j8]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Full Abstraction for Probabilistic PCF. J. ACM 65(4): 23:1-23:44 (2018) - [j7]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming. Proc. ACM Program. Lang. 2(POPL): 59:1-59:28 (2018) - 2017
- [j6]Michele Pagani, Paolo Tranquilli:
The conservation theorem for differential nets. Math. Struct. Comput. Sci. 27(6): 939-992 (2017) - 2012
- [j5]Michele Pagani:
Visible acyclic differential nets, Part I: Semantics. Ann. Pure Appl. Log. 163(3): 238-265 (2012) - 2011
- [j4]Daniel de Carvalho, Michele Pagani, Lorenzo Tortora de Falco:
A semantic measure of the execution time in linear logic. Theor. Comput. Sci. 412(20): 1884-1902 (2011) - 2010
- [j3]Michele Pagani, Simona Ronchi Della Rocca:
Linearity, Non-determinism and Solvability. Fundam. Informaticae 103(1-4): 173-202 (2010) - [j2]Michele Pagani, Lorenzo Tortora de Falco:
Strong normalization property for second order linear logic. Theor. Comput. Sci. 411(2): 410-444 (2010) - 2007
- [j1]Michele Pagani:
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic. Math. Struct. Comput. Sci. 17(2): 341-359 (2007)
Conference and Workshop Papers
- 2023
- [c20]Thomas Ehrhard, Claudia Faggian, Michele Pagani:
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. FSCD 2023: 8:1-8:18 - 2020
- [c19]Gianluca Curzi, Michele Pagani:
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. LICS 2020: 327-340 - 2019
- [c18]Thomas Leventis, Michele Pagani:
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. FoSSaCS 2019: 365-381 - [c17]Simona Kasterovic, Michele Pagani:
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus. FSCD 2019: 26:1-26:20 - 2017
- [c16]Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Free Exponential Modality of Probabilistic Coherence Spaces. FoSSaCS 2017: 20-35 - 2016
- [c15]Michele Pagani, Christine Tasson, Lionel Vaux:
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms. FoSSaCS 2016: 408-423 - 2015
- [c14]Flavien Breuvart, Michele Pagani:
Modelling Coeffects in the Relational Semantics of Linear Logic. CSL 2015: 567-581 - 2014
- [c13]Thomas Ehrhard, Christine Tasson, Michele Pagani:
Probabilistic coherence spaces are fully abstract for probabilistic PCF. POPL 2014: 309-320 - [c12]Michele Pagani, Peter Selinger, Benoît Valiron:
Applying quantitative semantics to higher-order quantum computing. POPL 2014: 647-658 - 2013
- [c11]Pierre Boudes, Fanny He, Michele Pagani:
A characterization of the Taylor expansion of lambda-terms. CSL 2013: 101-115 - [c10]Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani:
Call-by-Value Non-determinism in a Linear Logic Type Discipline. LFCS 2013: 164-178 - [c9]Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani:
Weighted Relational Models of Typed Lambda-Calculi. LICS 2013: 301-310 - 2011
- [c8]Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Computational Meaning of Probabilistic Coherence Spaces. LICS 2011: 87-96 - [c7]Giulio Manzonetto, Michele Pagani:
Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion. TLCA 2011: 153-168 - 2010
- [c6]Michele Pagani, Simona Ronchi Della Rocca:
Solvability in Resource Lambda-Calculus. FoSSaCS 2010: 358-373 - 2009
- [c5]Michele Pagani, Paolo Tranquilli:
Parallel Reduction in Resource Lambda-Calculus. APLAS 2009: 226-242 - [c4]Michele Pagani, Christine Tasson:
The Inverse Taylor Expansion Problem in Linear Logic. LICS 2009: 222-231 - [c3]Michele Pagani:
The Cut-Elimination Theorem for Differential Nets with Promotion. TLCA 2009: 219-233 - 2007
- [c2]Damiano Mazza, Michele Pagani:
The Separation Theorem for Differential Interaction Nets. LPAR 2007: 393-407 - 2006
- [c1]Michele Pagani:
Acyclicity and Coherence in Multiplicative Exponential Linear Logic. CSL 2006: 531-545
Editorship
- 2019
- [e1]Michele Pagani, Sandra Alves:
Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, DCM/ITRS 2018, Oxford, UK, 8th July 2018. EPTCS 293, 2019 [contents]
Informal and Other Publications
- 2020
- [i9]Gianluca Curzi, Michele Pagani:
The Benefit of Being Non-Lazy in Probabilistic λ-calculus. CoRR abs/2004.12891 (2020) - [i8]Damiano Mazza, Michele Pagani:
Automatic Differentiation in PCF. CoRR abs/2011.03335 (2020) - 2019
- [i7]Aloïs Brunel, Damiano Mazza, Michele Pagani:
Backpropagation in the Simply Typed Lambda-calculus with Linear Negation. CoRR abs/1909.13768 (2019) - 2018
- [i6]Axel Kerinec, Giulio Manzonetto, Michele Pagani:
Revisiting Call-by-value Bohm trees in light of their Taylor expansion. CoRR abs/1809.02659 (2018) - 2017
- [i5]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Measurable Cones and Stable, Measurable Functions. CoRR abs/1711.09640 (2017) - 2016
- [i4]Michele Pagani, Christine Tasson, Lionel Vaux:
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms. CoRR abs/1603.07218 (2016) - 2015
- [i3]Thomas Ehrhard, Michele Pagani, Christine Tasson:
Full abstraction for probabilistic PCF. CoRR abs/1511.01272 (2015) - 2013
- [i2]Michele Pagani, Peter Selinger, Benoît Valiron:
Applying quantitative semantics to higher-order quantum computing. CoRR abs/1311.2290 (2013) - [i1]Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani:
Call-by-value non-determinism in a linear logic type discipline. CoRR abs/1312.4507 (2013)
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:07 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:
