Michele Pagani

According to our database, Michele Pagani authored at least 37 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic.

Thomas Ehrhard, Claudia Faggian, Michele Pagani

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021

Automatic differentiation in PCF.

Damiano Mazza, Michele Pagani

Proc. ACM Program. Lang., 2021

2020

Backpropagation in the simply typed lambda-calculus with linear negation.

Aloïs Brunel, Damiano Mazza, Michele Pagani

Proc. ACM Program. Lang., 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

The Benefit of Being Non-Lazy in Probabilistic λ-calculus.

Gianluca Curzi, Michele Pagani

CoRR, 2020

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

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

New Semantical Insights Into Call-by-Value λ-Calculus.

Giulio Manzonetto, Michele Pagani, Simona Ronchi Della Rocca

Fundam. Informaticae, 2019

The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus.

Simona Kasterovic, Michele Pagani

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces.

Thomas Leventis, Michele Pagani

Proceedings of the Foundations of Software Science and Computation Structures, 2019

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

Full Abstraction for Probabilistic PCF.

Thomas Ehrhard, Michele Pagani, Christine Tasson

J. ACM, 2018

2017

The conservation theorem for differential nets.

Michele Pagani, Paolo Tranquilli

Math. Struct. Comput. Sci., 2017

Measurable Cones and Stable, Measurable Functions.

Thomas Ehrhard, Michele Pagani, Christine Tasson

CoRR, 2017

The Free Exponential Modality of Probabilistic Coherence Spaces.

Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms.

Michele Pagani, Christine Tasson, Lionel Vaux

CoRR, 2016

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms.

Michele Pagani, Christine Tasson, Lionel Vaux

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Modelling Coeffects in the Relational Semantics of Linear Logic.

Flavien Breuvart, Michele Pagani

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Applying quantitative semantics to higher-order quantum computing.

Michele Pagani, Peter Selinger, Benoît Valiron

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Probabilistic coherence spaces are fully abstract for probabilistic PCF.

Thomas Ehrhard, Christine Tasson, Michele Pagani

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013

Weighted Relational Models of Typed Lambda-Calculi.

Jim Laird, Giulio Manzonetto, Guy McCusker, Michele Pagani

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Call-by-Value Non-determinism in a Linear Logic Type Discipline.

Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

A characterization of the Taylor expansion of lambda-terms.

Pierre Boudes, Fanny He, Michele Pagani

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Some Advances in Linear Logic.

Michele Pagani

, 2013

2012

Visible acyclic differential nets, Part I: Semantics.

Michele Pagani

Ann. Pure Appl. Log., 2012

2011

A semantic measure of the execution time in linear logic.

Daniel de Carvalho, Michele Pagani, Lorenzo Tortora de Falco

Theor. Comput. Sci., 2011

Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion.

Giulio Manzonetto, Michele Pagani

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

The Computational Meaning of Probabilistic Coherence Spaces.

Thomas Ehrhard, Michele Pagani, Christine Tasson

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

Strong normalization property for second order linear logic.

Michele Pagani, Lorenzo Tortora de Falco

Theor. Comput. Sci., 2010

Linearity, Non-determinism and Solvability.

Michele Pagani, Simona Ronchi Della Rocca

Fundam. Informaticae, 2010

Solvability in Resource Lambda-Calculus.

Michele Pagani, Simona Ronchi Della Rocca

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

The Cut-Elimination Theorem for Differential Nets with Promotion.

Michele Pagani

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

The Inverse Taylor Expansion Problem in Linear Logic.

Michele Pagani, Christine Tasson

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Parallel Reduction in Resource Lambda-Calculus.

Michele Pagani, Paolo Tranquilli

Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2007

Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic.

Michele Pagani

Math. Struct. Comput. Sci., 2007

The Separation Theorem for Differential Interaction Nets.

Damiano Mazza, Michele Pagani

Proceedings of the Logic for Programming, 2007

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

PhD thesis, 2006

Acyclicity and Coherence in Multiplicative Exponential Linear Logic.

Michele Pagani

Proceedings of the Computer Science Logic, 20th International Workshop, 2006