Michele Pagani

49 papers A* 6B 11Misc 1Journal 25Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
JAX Autodiff from a Linear Logic Perspective.
Proc. ACM Program. Lang.
Giulia Giusti, Michele Pagani
2025 J jnl
JAX Autodiff from a Linear Logic Perspective (Extended Version).
CoRR
Giulia Giusti, Michele Pagani
2025 — conf
Variable Elimination as Rewriting in a Linear Lambda Calculus.
ESOP (1)
Thomas Ehrhard, Claudia Faggian, Michele Pagani
2025 J jnl
Variable Elimination as Rewriting in a Linear Lambda Calculus.
CoRR
Thomas Ehrhard, Claudia Faggian, Michele Pagani
2024 J jnl
Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference.
CoRR
Thomas Ehrhard, Claudia Faggian, Michele Pagani
2023 B conf
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic.
FSCD
Thomas Ehrhard, Claudia Faggian, Michele Pagani
2021 J jnl
Automatic differentiation in PCF.
Proc. ACM Program. Lang.
Damiano Mazza, Michele Pagani
2020 J jnl
Automatic Differentiation in PCF.
CoRR
Damiano Mazza, Michele Pagani
2020 J jnl
Backpropagation in the simply typed lambda-calculus with linear negation.
Proc. ACM Program. Lang.
Aloïs Brunel, Damiano Mazza, Michele Pagani
2020 J jnl
Revisiting Call-by-value Böhm trees in light of their Taylor expansion.
Log. Methods Comput. Sci.
Axel Kerinec, Giulio Manzonetto, Michele Pagani
2020 J jnl
The Benefit of Being Non-Lazy in Probabilistic λ-calculus.
CoRR
Gianluca Curzi, Michele Pagani
2020 A* conf
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name.
LICS
Gianluca Curzi, Michele Pagani
2019 J jnl
Backpropagation in the Simply Typed Lambda-calculus with Linear Negation.
CoRR
Aloïs Brunel, Damiano Mazza, Michele Pagani
2019 J jnl
New Semantical Insights Into Call-by-Value λ-Calculus.
Fundam. Informaticae
Giulio Manzonetto, Michele Pagani, Simona Ronchi Della Rocca
2019 — ed.
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.
DCM/ITRS
Michele Pagani, Sandra Alves
2019 B conf
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces.
FoSSaCS
Thomas Leventis, Michele Pagani
2019 B conf
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus.
FSCD
Simona Kasterovic, Michele Pagani
2018 J jnl
Full Abstraction for Probabilistic PCF.
J. ACM
Thomas Ehrhard, Michele Pagani, Christine Tasson
2018 J jnl
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming.
Proc. ACM Program. Lang.
Thomas Ehrhard, Michele Pagani, Christine Tasson
2018 J jnl
Revisiting Call-by-value Bohm trees in light of their Taylor expansion.
CoRR
Axel Kerinec, Giulio Manzonetto, Michele Pagani
2017 J jnl
Measurable Cones and Stable, Measurable Functions.
CoRR
Thomas Ehrhard, Michele Pagani, Christine Tasson
2017 B conf
The Free Exponential Modality of Probabilistic Coherence Spaces.
FoSSaCS
Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson
2017 J jnl
The conservation theorem for differential nets.
Math. Struct. Comput. Sci.
Michele Pagani, Paolo Tranquilli
2016 B conf
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms.
FoSSaCS
Michele Pagani, Christine Tasson, Lionel Vaux
2016 J jnl
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms.
CoRR
Michele Pagani, Christine Tasson, Lionel Vaux
2015 J jnl
Full abstraction for probabilistic PCF.
CoRR
Thomas Ehrhard, Michele Pagani, Christine Tasson
2015 B conf
Modelling Coeffects in the Relational Semantics of Linear Logic.
CSL
Flavien Breuvart, Michele Pagani
2014 A* conf
Applying quantitative semantics to higher-order quantum computing.
POPL
Michele Pagani, Peter Selinger, Benoît Valiron
2014 A* conf
Probabilistic coherence spaces are fully abstract for probabilistic PCF.
POPL
Thomas Ehrhard, Christine Tasson, Michele Pagani
2013 B conf
A characterization of the Taylor expansion of lambda-terms.
CSL
Pierre Boudes, Fanny He, Michele Pagani
2013 J jnl
Applying quantitative semantics to higher-order quantum computing.
CoRR
Michele Pagani, Peter Selinger, Benoît Valiron
2013 Misc conf
Call-by-Value Non-determinism in a Linear Logic Type Discipline.
LFCS
Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
2013 J jnl
Call-by-value non-determinism in a linear logic type discipline.
CoRR
Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
2013 — book
Some Advances in Linear Logic.
Michele Pagani
2013 A* conf
Weighted Relational Models of Typed Lambda-Calculi.
LICS
Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani
2012 J jnl
Visible acyclic differential nets, Part I: Semantics.
Ann. Pure Appl. Log.
Michele Pagani
2011 J jnl
A semantic measure of the execution time in linear logic.
Theor. Comput. Sci.
Daniel de Carvalho, Michele Pagani, Lorenzo Tortora de Falco
2011 — conf
Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion.
TLCA
Giulio Manzonetto, Michele Pagani
2011 A* conf
The Computational Meaning of Probabilistic Coherence Spaces.
LICS
Thomas Ehrhard, Michele Pagani, Christine Tasson
2010 J jnl
Linearity, Non-determinism and Solvability.
Fundam. Informaticae
Michele Pagani, Simona Ronchi Della Rocca
2010 B conf
Solvability in Resource Lambda-Calculus.
FoSSaCS
Michele Pagani, Simona Ronchi Della Rocca
2010 J jnl
Strong normalization property for second order linear logic.
Theor. Comput. Sci.
Michele Pagani, Lorenzo Tortora de Falco
2009 B conf
Parallel Reduction in Resource Lambda-Calculus.
APLAS
Michele Pagani, Paolo Tranquilli
2009 — conf
The Cut-Elimination Theorem for Differential Nets with Promotion.
TLCA
Michele Pagani
2009 A* conf
The Inverse Taylor Expansion Problem in Linear Logic.
LICS
Michele Pagani, Christine Tasson
2007 J jnl
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic.
Math. Struct. Comput. Sci.
Michele Pagani
2007 B conf
The Separation Theorem for Differential Interaction Nets.
LPAR
Damiano Mazza, Michele Pagani
2006 B conf
Acyclicity and Coherence in Multiplicative Exponential Linear Logic.
CSL
Michele Pagani
2006 — —
Proof nets and cliques: towards the understanding of analytical proofs. (Réseaux de preuves et cliques: vers une compréhension des preuves analytiques).
Michele Pagani