Acyclicity and Coherence in Multiplicative Exponential Linear Logic. - Michele Pagani (CSL, 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 (2006)

The Separation Theorem for Differential Interaction Nets. - Damiano Mazza; Michele Pagani (LPAR, 2007)

Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic. - Michele Pagani (Math. Struct. Comput. Sci., 2007)

Parallel Reduction in Resource Lambda-Calculus. - Michele Pagani; Paolo Tranquilli (APLAS, 2009)

The Inverse Taylor Expansion Problem in Linear Logic. - Michele Pagani; Christine Tasson (LICS, 2009)

The Cut-Elimination Theorem for Differential Nets with Promotion. - Michele Pagani (TLCA, 2009)

Solvability in Resource Lambda-Calculus. - Michele Pagani; Simona Ronchi Della Rocca (FoSSaCS, 2010)

Linearity, Non-determinism and Solvability. - Michele Pagani; Simona Ronchi Della Rocca (Fundam. Informaticae, 2010)

Strong normalization property for second order linear logic. - Michele Pagani; Lorenzo Tortora de Falco (Theor. Comput. Sci., 2010)

The Computational Meaning of Probabilistic Coherence Spaces. - Thomas Ehrhard; Michele Pagani; Christine Tasson (LICS, 2011)

Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion. - Giulio Manzonetto; Michele Pagani (TLCA, 2011)

A semantic measure of the execution time in linear logic. - Daniel de Carvalho; Michele Pagani; Lorenzo Tortora de Falco (Theor. Comput. Sci., 2011)

Visible acyclic differential nets, Part I: Semantics. - Michele Pagani (Ann. Pure Appl. Log., 2012)

Some Advances in Linear Logic. - Michele Pagani (2013)

A characterization of the Taylor expansion of lambda-terms. - Pierre Boudes; Fanny He; Michele Pagani (CSL, 2013)

Call-by-Value Non-determinism in a Linear Logic Type Discipline. - Alejandro Díaz-Caro; Giulio Manzonetto; Michele Pagani (LFCS, 2013)

Weighted Relational Models of Typed Lambda-Calculi. - Jim Laird; Giulio Manzonetto; Guy McCusker; Michele Pagani (LICS, 2013)

Probabilistic coherence spaces are fully abstract for probabilistic PCF. - Thomas Ehrhard; Christine Tasson; Michele Pagani (POPL, 2014)

Applying quantitative semantics to higher-order quantum computing. - Michele Pagani; Peter Selinger; Benoît Valiron (POPL, 2014)

Modelling Coeffects in the Relational Semantics of Linear Logic. - Flavien Breuvart; Michele Pagani (CSL, 2015)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda λ -terms. - Michele Pagani; Christine Tasson; Lionel Vaux (FoSSaCS, 2016)

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms. - Michele Pagani; Christine Tasson; Lionel Vaux (CoRR, 2016)

The Free Exponential Modality of Probabilistic Coherence Spaces. - Raphaëlle Crubillé; Thomas Ehrhard; Michele Pagani; Christine Tasson (FoSSaCS, 2017)

Measurable Cones and Stable, Measurable Functions. - Thomas Ehrhard; Michele Pagani; Christine Tasson (CoRR, 2017)

The conservation theorem for differential nets. - Michele Pagani; Paolo Tranquilli (Math. Struct. Comput. Sci., 2017)

Full Abstraction for Probabilistic PCF. - Thomas Ehrhard; Michele Pagani; Christine Tasson (J. ACM, 2018)

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming. - Thomas Ehrhard; Michele Pagani; Christine Tasson (Proc. ACM Program. Lang., 2018)

Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. - Thomas Leventis; Michele Pagani (FoSSaCS, 2019)

The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus. - Simona Kasterovic; Michele Pagani (FSCD, 2019)

New Semantical Insights Into Call-by-Value λ-Calculus. - Giulio Manzonetto; Michele Pagani; Simona Ronchi Della Rocca (Fundam. Informaticae, 2019)

The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. - Gianluca Curzi; Michele Pagani (LICS, 2020)

The Benefit of Being Non-Lazy in Probabilistic λ-calculus. - Gianluca Curzi; Michele Pagani (CoRR, 2020)

Revisiting Call-by-value Böhm trees in light of their Taylor expansion. - Axel Kerinec; Giulio Manzonetto; Michele Pagani (Log. Methods Comput. Sci., 2020)

Backpropagation in the simply typed lambda-calculus with linear negation. - Aloïs Brunel; Damiano Mazza; Michele Pagani (Proc. ACM Program. Lang., 2020)

Automatic differentiation in PCF. - Damiano Mazza; Michele Pagani (Proc. ACM Program. Lang., 2021)

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (FSCD, 2023)

Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (CoRR, 2024)

Variable Elimination as Rewriting in a Linear Lambda Calculus. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (ESOP (1), 2025)