Michele Pagani

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 19

Top Topics

Relational Models

Multilayer Perceptron Neural Network

Sequent Calculus

Top Venues

Proc. ACM Program. Lang.

Publications

Thomas Ehrhard, Claudia Faggian, Michele Pagani
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. FSCD (2023)
Damiano Mazza, Michele Pagani
Automatic differentiation in PCF. Proc. ACM Program. Lang. 5 (POPL) (2021)
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)
Gianluca Curzi, Michele Pagani
The Benefit of Being Non-Lazy in Probabilistic λ-calculus. CoRR (2020)
Aloïs Brunel, Damiano Mazza, Michele Pagani
Backpropagation in the simply typed lambda-calculus with linear negation. Proc. ACM Program. Lang. 4 (POPL) (2020)
Damiano Mazza, Michele Pagani
Automatic Differentiation in PCF. CoRR (2020)
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)
Thomas Leventis, Michele Pagani
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. FoSSaCS (2019)
Simona Kasterovic, Michele Pagani
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus. FSCD (2019)
Giulio Manzonetto, Michele Pagani, Simona Ronchi Della Rocca
New Semantical Insights Into Call-by-Value λ-Calculus. Fundam. Informaticae 170 (1-3) (2019)
Aloïs Brunel, Damiano Mazza, Michele Pagani
Backpropagation in the Simply Typed Lambda-calculus with Linear Negation. CoRR (2019)
Axel Kerinec, Giulio Manzonetto, Michele Pagani
Revisiting Call-by-value Bohm trees in light of their Taylor expansion. CoRR (2018)
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) (2018)
Thomas Ehrhard, Michele Pagani, Christine Tasson
Full Abstraction for Probabilistic PCF. J. ACM 65 (4) (2018)
Michele Pagani, Paolo Tranquilli
The conservation theorem for differential nets. Math. Struct. Comput. Sci. 27 (6) (2017)
Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson
The Free Exponential Modality of Probabilistic Coherence Spaces. FoSSaCS (2017)
Thomas Ehrhard, Michele Pagani, Christine Tasson
Measurable Cones and Stable, Measurable Functions. CoRR (2017)
Michele Pagani, Christine Tasson, Lionel Vaux
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms. CoRR (2016)
Michele Pagani, Christine Tasson, Lionel Vaux
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms. FoSSaCS (2016)
Flavien Breuvart, Michele Pagani
Modelling Coeffects in the Relational Semantics of Linear Logic. CSL (2015)
Thomas Ehrhard, Michele Pagani, Christine Tasson
Full abstraction for probabilistic PCF. CoRR (2015)
Michele Pagani, Peter Selinger, Benoît Valiron
Applying quantitative semantics to higher-order quantum computing. POPL (2014)
Thomas Ehrhard, Christine Tasson, Michele Pagani
Probabilistic coherence spaces are fully abstract for probabilistic PCF. POPL (2014)
Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
Call-by-Value Non-determinism in a Linear Logic Type Discipline. LFCS (2013)
Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
Call-by-value non-determinism in a linear logic type discipline. CoRR (2013)
Pierre Boudes, Fanny He, Michele Pagani
A characterization of the Taylor expansion of lambda-terms. CSL (2013)
Michele Pagani, Peter Selinger, Benoît Valiron
Applying quantitative semantics to higher-order quantum computing. CoRR (2013)
Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani
Weighted Relational Models of Typed Lambda-Calculi. LICS (2013)
Michele Pagani
Visible acyclic differential nets, Part I: Semantics. Ann. Pure Appl. Log. 163 (3) (2012)
Giulio Manzonetto, Michele Pagani
Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion. TLCA (2011)
Daniel de Carvalho, Michele Pagani, Lorenzo Tortora de Falco
A semantic measure of the execution time in linear logic. Theor. Comput. Sci. 412 (20) (2011)
Thomas Ehrhard, Michele Pagani, Christine Tasson
The Computational Meaning of Probabilistic Coherence Spaces. LICS (2011)
Michele Pagani, Lorenzo Tortora de Falco
Strong normalization property for second order linear logic. Theor. Comput. Sci. 411 (2) (2010)
Michele Pagani, Simona Ronchi Della Rocca
Linearity, Non-determinism and Solvability. Fundam. Informaticae 103 (1-4) (2010)
Michele Pagani, Simona Ronchi Della Rocca
Solvability in Resource Lambda-Calculus. FoSSaCS (2010)
Michele Pagani, Paolo Tranquilli
Parallel Reduction in Resource Lambda-Calculus. APLAS (2009)
Michele Pagani
The Cut-Elimination Theorem for Differential Nets with Promotion. TLCA (2009)
Michele Pagani, Christine Tasson
The Inverse Taylor Expansion Problem in Linear Logic. LICS (2009)
Damiano Mazza, Michele Pagani
The Separation Theorem for Differential Interaction Nets. LPAR (2007)
Michele Pagani
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic. Math. Struct. Comput. Sci. 17 (2) (2007)
Michele Pagani
Acyclicity and Coherence in Multiplicative Exponential Linear Logic. CSL (2006)