Michele Pagani

发表

The Separation Theorem for Differential Interaction Nets

Damiano Mazza, Michele Pagani, Michele Pagani, 2007, LPAR.

Modelling Coeffects in the Relational Semantics of Linear Logic

Michele Pagani, Flavien Breuvart, Flavien Breuvart, 2015, CSL.

Toward analytic rewriting theory

Michele Pagani, Benoît Valiron, Andrew Polonski, 2016 .

A characterization of the Taylor expansion of lambda-terms

Michele Pagani, Pierre Boudes, Fanny He, 2013, CSL.

The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name

Michele Pagani, Gianluca Curzi, Michele Pagani, 2020, LICS.

The Inverse Taylor Expansion Problem in Linear Logic

Michele Pagani, Christine Tasson, Michele Pagani, 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

The conservation theorem for differential nets

Michele Pagani, Paolo Tranquilli, P. Tranquilli, 2015, Mathematical Structures in Computer Science.

Full Abstraction for Probabilistic PCF

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2015, J. ACM.

The Benefit of Being Non-Lazy in Probabilistic {\lambda}-calculus

Michele Pagani, Gianluca Curzi, Michele Pagani, 2020, 2004.12891.

Solvability in Resource Lambda-Calculus

Michele Pagani, Simona Ronchi Della Rocca, S. D. Rocca, 2010, FoSSaCS.

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

Giulio Manzonetto, Michele Pagani, Simona Ronchi Della Rocca, 2019, Fundam. Informaticae.

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

Michele Pagani, Christine Tasson, Lionel Vaux, 2016, FoSSaCS.

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

Giulio Manzonetto, Michele Pagani, Alejandro Díaz-Caro, 2013, LFCS.

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

Giulio Manzonetto, Michele Pagani, Giulio Manzonetto, 2011, TLCA.

Backpropagation in the simply typed lambda-calculus with linear negation

Damiano Mazza, Michele Pagani, Alois Brunel, 2020, Proc. ACM Program. Lang..

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

Michele Pagani, Sandra Alves, 2019, DCM/ITRS.

Parallel Reduction in Resource Lambda-Calculus

Michele Pagani, Paolo Tranquilli, 2009, APLAS.

The Cut-Elimination Theorem for Differential Nets with Promotion

Michele Pagani, Michele Pagani, 2009, TLCA.

Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic

Michele Pagani, Michele Pagani, 2007, Mathematical Structures in Computer Science.

Intersection Types, Quantitative Semantics and Linear Logic: Invited Talk at the Eighth Workshop on Intersection Types and Related Systems

Michele Pagani, 2017 .

Weighted Relational Models of Typed Lambda-Calculi

Giulio Manzonetto, Michele Pagani, Guy McCusker, 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

Probabilistic coherence spaces are fully abstract for probabilistic PCF

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2014, POPL.

Revisiting Call-by-value Bohm trees in light of their Taylor expansion

Giulio Manzonetto, Michele Pagani, Emma Kerinec, 2018, Log. Methods Comput. Sci..

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

Michele Pagani, Christine Tasson, Lionel Vaux, 2016, FoSSaCS.

Applying quantitative semantics to higher-order quantum computing

Michele Pagani, Benoît Valiron, Peter Selinger, 2013, POPL.

Visible acyclic differential nets, Part I: Semantics

Michele Pagani, Michele Pagani, 2012, Ann. Pure Appl. Log..

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

Michele Pagani, Simona Kasterovic, Michele Pagani, 2019, FSCD.

The Free Exponential Modality of Probabilistic Coherence Spaces

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2017, FoSSaCS.

Strong normalization property for second order linear logic

Michele Pagani, Lorenzo Tortora de Falco, L. Falco, 2010, Theor. Comput. Sci..

A semantic measure of the execution time in linear logic

Michele Pagani, Lorenzo Tortora de Falco, Daniel de Carvalho, 2011, Theor. Comput. Sci..

Automatic differentiation in PCF

Damiano Mazza, Michele Pagani, Michele Pagani, 2020, Proc. ACM Program. Lang..

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2017, Proc. ACM Program. Lang..

Acyclicity and Coherence in Multiplicative Exponential Linear Logic

Michele Pagani, Michele Pagani, 2006, CSL.

Linearity, Non-determinism and Solvability

Michele Pagani, Simona Ronchi Della Rocca, S. D. Rocca, 2010, Fundam. Informaticae.

Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems: Preface

Michele Pagani, Sandra Alves, 2019 .

The Computational Meaning of Probabilistic Coherence Spaces

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces

Michele Pagani, Thomas Leventis, 2019, FoSSaCS.

Measurable Cones and Stable, Measurable Functions pdf

Thomas Ehrhard, Michele Pagani, Christine Tasson, 2018, POPL 2018.

Stream Associative Nets and Lambda-mu-calculus

Alexis Saurin, Michele Pagani, 2008 .