Michele Pagani

35
Documents

Publications

22
6
4
3
16
7
6
6
5
3
3
3
3
3
3
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
7
7
3
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

Publications

Deposit thumbnail

Automatic Differentiation in PCF

Damiano Mazza , Michele Pagani

Proceedings of the ACM on Programming Languages, 2021, 5, pp.1 - 27. ⟨10.1145/3434309⟩

Article dans une revue hal-03379031v1
Deposit thumbnail

Backpropagation in the Simply Typed Lambda-Calculus with Linear Negation

Aloïs Brunel , Damiano Mazza , Michele Pagani

Proceedings of the ACM on Programming Languages, 2020

Article dans une revue hal-02400927v1
Deposit thumbnail

Revisiting Call-by-value Böhm trees in light of their Taylor expansion

Emma Kerinec , Giulio Manzonetto , Michele Pagani

Logical Methods in Computer Science, 2020, 16 (3), ⟨10.23638/LMCS-16(3:6)2020⟩

Article dans une revue hal-04670076v1

Full Abstraction for Probabilistic PCF

Thomas Ehrhard , Michele Pagani , Christine Tasson

Journal of the ACM (JACM), 2018, 65 (4), pp.1-44. ⟨10.1145/3164540⟩

Article dans une revue hal-02346086v1

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

Thomas Ehrhard , Michele Pagani , Christine Tasson

Proceedings of the ACM on Programming Languages, 2017, 2 (POPL), pp.1-28. ⟨10.1145/3158147⟩

Article dans une revue hal-02346093v1
Deposit thumbnail

The conservation theorem for differential nets

Michele Pagani , Paolo Tranquilli

Mathematical Structures in Computer Science, 2015, 27 (6), pp.939-992. ⟨10.1017/S0960129515000456⟩

Article dans une revue hal-04670079v1

A semantic measure of the execution time in linear logic

Michele Pagani , Lorenzo Tortora de Falco , Daniel de Carvalho

Theoretical Computer Science, 2011, 412 (20), pp.1884-1902. ⟨10.1016/j.tcs.2010.12.017⟩

Article dans une revue istex hal-00698976v1
Deposit thumbnail

Visible acyclic differential nets, Part I: Semantics

Michele Pagani

Annals of Pure and Applied Logic, 2011, 163 (3), pp.238-265. ⟨10.1016/j.apal.2011.09.001⟩

Article dans une revue hal-00698973v1
Deposit thumbnail

Linearity, Non-determinism and Solvability

Michele Pagani , Simona Ronchi Della Rocca

Fundamenta Informaticae, 2010, From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday, 103 (1-4), pp.173-202. ⟨10.3233/FI-2010-324⟩

Article dans une revue hal-04670080v1

Strong normalization property for second order linear logic

Michele Pagani , Lorenzo Tortora de Falco

Theoretical Computer Science, 2009, 411, pp.410-444. ⟨10.1016/j.tcs.2009.07.053⟩

Article dans une revue istex hal-00698979v1
Deposit thumbnail

Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic

Michele Pagani

Mathematical Structures in Computer Science, 2007, 17 (2), pp.341-359. ⟨10.1017/S0960129506005652⟩

Article dans une revue hal-04670082v1

Variable Elimination as Rewriting in a Linear Lambda Calculus

Thomas Ehrhard , Claudia Faggian , Michele Pagani

Programming Languages and Systems - 34th European Symposium on Programming, ESOP 2025, May 2025, Hamilton, Canada. pp.292-321, ⟨10.1007/978-3-031-91118-7_12⟩

Communication dans un congrès hal-05387898v1
Deposit thumbnail

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic

Thomas Ehrhard , Claudia Faggian , Michele Pagani

8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), 2023, Roma, Italy. pp.8:1--8:18, ⟨10.4230/LIPIcs.FSCD.2023.8⟩

Communication dans un congrès hal-04267615v1

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 '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2020, Saarbrücken, Germany. pp.327-340, ⟨10.1145/3373718.3394806⟩

Communication dans un congrès hal-03586172v1
Deposit thumbnail

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

Simona Kašterović , Michele Pagani

4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.26⟩

Communication dans un congrès hal-04670084v1
Deposit thumbnail

The Free Exponential Modality of Probabilistic Coherence Spaces

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

Foundations of Software Science and Computation Structures (FOSSACS 2017), Apr 2017, Uppsala, Sweden. pp.20-35, ⟨10.1007/978-3-662-54458-7_2⟩

Communication dans un congrès hal-02357979v1
Deposit thumbnail

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

Michele Pagani , Christine Tasson , Lionel Vaux

19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2016), Apr 2016, Eindhoven, Netherlands. pp 408-423

Communication dans un congrès hal-01292923v1

Toward analytic rewriting theory

Benoît Valiron , Michele Pagani , Andrew Polonski

Informal Electronic Proceedings of the 8th International Workshop on Higher-Order Rewriting (HOR’16), 2016, Porto, Portugal

Communication dans un congrès hal-01763461v1
Deposit thumbnail

Modelling Coeffects in the Relational Semantics of Linear Logic

Flavien Breuvart , Michele Pagani

24th EACSL Annual Conference on Computer Science Logic (CSL 2015), EACSL, Sep 2015, Berlin, Germany. ⟨10.4230/LIPIcs.CSL.2015.567⟩

Communication dans un congrès hal-04670088v1
Deposit thumbnail

Probabilistic coherence spaces are fully abstract for probabilistic PCF

Thomas Ehrhard , Christine Tasson , Michele Pagani

The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '14), Jan 2014, San Diego, CA, United States. pp.309-320, ⟨10.1145/2535838.2535865⟩

Communication dans un congrès hal-04670288v1
Deposit thumbnail

Applying quantitative semantics to higher-order quantum computing

Michele Pagani , Peter Selinger , Benoît Valiron

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM SIGPLAN-SIGACT, Jan 2014, San Diego (California), United States. pp.647-658, ⟨10.1145/2578855.2535879⟩

Communication dans un congrès hal-04670287v1
Deposit thumbnail

A characterization of the Taylor expansion of lambda-terms

Pierre Boudes , Fanny He , Michele Pagani

22nd EACSL Annual Conference Computer Science Logic (CSL 2013), EACSL, Sep 2013, Turin, Italy. pp.101-115, ⟨10.4230/LIPIcs.CSL.2013.101⟩

Communication dans un congrès hal-04670289v1
Deposit thumbnail

Call-by-value non-determinism in a linear logic type discipline

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

LFCS - Logical Foundations of Computer Science - 2013, Jan 2013, San Diego, CA, United States. pp.164-178, ⟨10.1007/978-3-642-35722-0_12⟩

Communication dans un congrès hal-00919463v1

Weighted Relational Models of Typed Lambda-Calculi

Jim Laird , Manzonetto Giulio , Guy Mccusker , Michele Pagani

28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, Jun 2013, New Orleans, LA, United States. ⟨10.1109/LICS.2013.36⟩

Communication dans un congrès hal-01144064v1
Deposit thumbnail

The computational meaning of probabilistic coherent spaces

Thomas Ehrhard , Michele Pagani , Christine Tasson

Logic in Computer Science (LICS), Jun 2011, Toronto, ON, Canada. pp.87 - 96, ⟨10.1109/LICS.2011.29⟩

Communication dans un congrès hal-00627490v1
Deposit thumbnail

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

Giulio Manzonetto , Michele Pagani

10th International Conference on Typed Lambda Calculi and Applications (TLCA 2011), 2011, Oxford, United Kingdom. pp.153-168, ⟨10.1007/978-3-642-21691-6_14⟩

Communication dans un congrès hal-04670290v1
Deposit thumbnail

The inverse Taylor expansion problem in linear logic

Michele Pagani , Christine Tasson

Logic in Computer Science, Aug 2009, Los Angeles, United States. pp.222--231, ⟨10.1109/LICS.2009.19⟩

Communication dans un congrès hal-00440684v1
Deposit thumbnail

Parallel Reduction in Resource Lambda-Calculus

Michele Pagani , Paolo Tranquilli

7th Asian Symposium on Programming Languages and Systems (APLAS 2009), Dec 2009, Seoul, South Korea. pp.226-242, ⟨10.1007/978-3-642-10672-9_17⟩

Communication dans un congrès istex hal-00699013v1
Deposit thumbnail

The Cut-Elimination Thereom for Differential Nets with Promotion

Michele Pagani

9th International Conference on Typed Lambda Calculi and Applications (TLCA 2009), Jul 2009, Brasilia, Brazil. pp.219-233, ⟨10.1007/978-3-642-02273-9_17⟩

Communication dans un congrès istex hal-00698974v1
Deposit thumbnail

The Separation Theorem for Differential Interaction Nets

Damiano Mazza , Michele Pagani

14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007), Oct 2007, Yerevan, Armenia. pp.393-407, ⟨10.1007/978-3-540-75560-9_29⟩

Communication dans un congrès hal-04670297v1
Deposit thumbnail

Acyclicity and Coherence in Multiplicative Exponential Linear Logic

Michele Pagani

Computer Science Logic. CSL 2006, EACSL, 2006, Szeged, Hungary. pp.531-545, ⟨10.1007/11874683_35⟩

Communication dans un congrès hal-04670298v1
Deposit thumbnail

A semantic measure of the execution time in Linear Logic

Daniel de Carvalho , Michele Pagani , Lorenzo Tortora de Falco

[Research Report] RR-6441, INRIA. 2008, pp.48

Rapport (rapport de recherche) inria-00206099v4
Deposit thumbnail

Stream Associative Nets and Lambda-mu-calculus

Michele Pagani , Alexis Saurin

[Research Report] RR-6431, INRIA. 2008, pp.48

Rapport (rapport de recherche) inria-00221221v3

Proof nets and cliques: towards the understanding of analytical proofs

Michele Pagani

Logic [math.LO]. Università Roma Tre; Université de la Méditerrannée, 2006. English. ⟨NNT : ⟩

Thèse tel-04670310v1

Some Advances in Linear Logic

Michele Pagani

Logic in Computer Science [cs.LO]. Université Paris Nord (Paris 13), 2013

HDR tel-04670301v1