Michele Pagani

According to our database1, Michele Pagani authored at least 34 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Automatic differentiation in PCF.
Proc. ACM Program. Lang., 2021

2020
Backpropagation in the simply typed lambda-calculus with linear negation.
Proc. ACM Program. Lang., 2020

Revisiting Call-by-value Böhm trees in light of their Taylor expansion.
Log. Methods Comput. Sci., 2020

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

The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name.
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.
Fundam. Informaticae, 2019

The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces.
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.
Proc. ACM Program. Lang., 2018

Full Abstraction for Probabilistic PCF.
J. ACM, 2018

2017
The conservation theorem for differential nets.
Math. Struct. Comput. Sci., 2017

Measurable Cones and Stable, Measurable Functions.
CoRR, 2017

The Free Exponential Modality of Probabilistic Coherence Spaces.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

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

Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Modelling Coeffects in the Relational Semantics of Linear Logic.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Applying quantitative semantics to higher-order quantum computing.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Probabilistic coherence spaces are fully abstract for probabilistic PCF.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Weighted Relational Models of Typed Lambda-Calculi.
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.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

A characterization of the Taylor expansion of lambda-terms.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Visible acyclic differential nets, Part I: Semantics.
Ann. Pure Appl. Log., 2012

2011
A semantic measure of the execution time in linear logic.
Theor. Comput. Sci., 2011

Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

The Computational Meaning of Probabilistic Coherence Spaces.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Strong normalization property for second order linear logic.
Theor. Comput. Sci., 2010

Linearity, Non-determinism and Solvability.
Fundam. Informaticae, 2010

Solvability in Resource Lambda-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
The Cut-Elimination Theorem for Differential Nets with Promotion.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

The Inverse Taylor Expansion Problem in Linear Logic.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Parallel Reduction in Resource Lambda-Calculus.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2007
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic.
Math. Struct. Comput. Sci., 2007

The Separation Theorem for Differential Interaction Nets.
Proceedings of the Logic for Programming, 2007

2006
Acyclicity and Coherence in Multiplicative Exponential Linear Logic.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006


  Loading...