Paolo Pistone
paolo.pistone[at]enslyon.fr
paolo.pistone[at]uniroma3.it
École Normale Supérieure de Lyon, 46 allée d'Italie, 69007 Lyon.
Junior Professor (Chaire Professeur Junior) at Université Claude Bernard Lyon 1 and
Laboratoire de l'Informatique du Parallélisme.
Previously I was:
 Assistant Professor at Dipartimento di Informatica  Scienza e Ingegneria, Università di Bologna (2023),
 Assistant Professor at Dipartimento di Matematica e Fisica, Università Roma Tre (20222023),
 postdoc at Dipartimento di InformaticaScienza e Ingegneria, Università di Bologna, within Ugo Dal Lago's ERC project DIAPASoN (20192022),
 postdoc at the Wilhelm Schickard Institute for Computer Science at Tübingen University (20182019),
 postdoc at Dipartimento di Matematica e Fisica,
Università Roma Tre (20162018),
 ATER at the Institut de Mathématiques de Marseille, Université d'AixMarseille (20152016).
I obtained a joint PhD in Mathematics and Philosophy in 2015 from Université d'AixMarseille and Università Roma Tre, under the supervision of JeanYves Girard and Michele Abrusci. My PhD thesis (that you can find below) was awarded the "Prix de Thèse 2016" by AixMarseille University.
Here is my CV (last update: April 2022).
My research interests are in logic and in the semantics of programming languages, and revolve around the CurryHoward Correspondence (CHC) between formal proofs and verified functional programs or, more precisely, between proof systems and typed lambdacalculi.
In particular, much of my research has been devoted to
System F, a cornerstone of the CHC relating (impredicative) second order quantification in logic with polymorphic programming.
More recently, I have been investigating extensions of the CHC to account for approximated and probabilistic programs.
Key words:
 second order logic / System F: prooftheory, categorical semantics, parametricity, impredicativity
 general proof theory: identity of proofs/program equivalence, linear logic, proof nets
 differential semantics: program similarity/metrics, logics for probabilistic programs
Papers and preprints:
Mathematical Logic/ Theoretical Computer Science:

Tropical Mathematics and the LambdaCalculus I: Metric and Differential Analysis of Effectful Programs (with Davide Barbarossa),
Extended Version.
Proceedings CSL 2024, LIPIcs vol. 288, pp. 14:114:23, 2024;

Enumerating ErrorBounded Polytime Algorithms Through Arithmetical Theories (with Melissa Antonelli, Ugo Dal Lago, Davide Davoli, and Isabel Oitavem),
Extended Version.
Proceedings CSL 2024, LIPIcs vol. 288, pp. 10:110:19, 2024;

Differences and Metrics in Program Semantics: Advances in Quantitative Relational Reasoning (volume edited with Ugo Dal Lago and Francesco Gavazzo),
Mathematical Structures in Computer Science, Special Issue 45, Vol. 33, 2023;

Towards Logical Foundations for Probabilistic Computation (with Melissa Antonelli and Ugo Dal Lago),
Annals of Pure and Applied Logic, in press, 2023;

On Counting Propositional Logic and Wagner's Hierarchy (with Melissa Antonelli and Ugo Dal Lago),
Theoretical Computer Science, Vol. 966967, 2023;

On the Lattice of Program Metrics (with Ugo Dal Lago and Naohiko Hoshino),
Proceedings FSCD 2023, LIPIcs vol. 260, pp. 20:120:19, 2023;

Curry and Howard Meet Borel (with Melissa Antonelli and Ugo Dal Lago),
Extended Version
Proceedings LICS 2022, IEEE Computer Society, pp. 113, 2022;

On Quantitative Algebraic HigherOrder Theories (with Ugo Dal Lago, Furio Honsell and Marina Lenisa),
Extended Version
Proceedings FSCD 2022, LIPIcs vol. 228, pp. 4:14:18, 2022;

From Identity to Difference: A Quantitative Interpretation of the Identity Type,
ArXiv;

The naturality of natural deduction II. On atomic polymorphism and generalized propositional connectives (with Luca Tranchini and Mattia Petrolo),
Studia Logica, vol. 110, pp. 545592, 2022;

The Yoneda Reduction of Polymorphic Types (Abstract) (with Luca Tranchini),
Proceedings SOQE 2021, CEUR Workshop Proceedings, pp. 9297, 2021;

On Counting Propositional Logic and Wagner's Counting Hierarchy (with Melissa Antonelli and Ugo Dal Lago),
Proceedings ICTCS 2021, CEUR Workshop Proceedings, pp. 107121, 2021;

On Generalized Metric Spaces for the Simply Typed LambdaCalculus,
Proceedings LICS 2021, IEEE Computer Society, pp. 114, 2021 (online talk);

What's Decidable about (Atomic) Polymorphism? (with Luca Tranchini),
Proceedings FSCD 2021, LIPIcs vol. 195, pp. 27:127:23, 2021 (online talk);

On Measure Quantifiers in FirstOrder Arithmetic (with Melissa Antonelli and Ugo Dal Lago),
Proceedings CiE 2021, LNCS vol. 12813, pp. 1224, 2021;
 A Partial Metric Semantics of HigherOrder Types and Approximate Program Transformations (with Guillaume Geoffroy),
Proceedings CSL 2021, LIPIcs vol. 183, pp. 23:123:18, 2021;
 The Yoneda Reduction of Polymorphic Types (with Luca Tranchini),
Extended Version,
Proceedings CSL 2021, LIPIcs vol. 183, pp. 35:135:22, 2021 (online talk from minute 53:23);
 Finite semantics of polymorphism, complexity and the power of type fixpoints (with L.T.D. Nguyễn, T. Seiller and L. Tortora de Falco);

Proof nets, coends and the Yoneda isomorphism,
Proceedings LinearityTLLA 2018, ArXiv :1904.06159; EPTCS 292, pp. 148167, 2019;
 Proof nets and the instantiation overflow property, ArXiv;
 On completeness and parametricity in the realizability semantics of System F,
Logical Methods in Computer Science, 15(4), pp. 6:16:54, 2019;
 Polymorphism and the obstinate circularity of second order logic: a victims' tale,
The Bulletin of Symbolic Logic, 24(1), pp. 152, 2018. Link to BSL;
 The naturality of natural deduction I (with Luca Tranchini and Mattia Petrolo)
Studia Logica, 107(1), pp. 195231, 2019. Link to SL;
 On dinaturality, typability and betaetastable models,
Proceedings FSCD 2017, LIPIcs vol. 84, pp. 29:129:17, 2017;
 Logic Programming and Logarithmic Space (with C. Aubert, M. Bagnol and T. Seiller),
Programming Languages and Systems, 12th Asian Symposium APLAS 2014, Singapore, volume 8858 of Lecture Notes in Computer Science, pp. 3957, Springer, 2014.
Philosophy of Logic:

A New Conjecture About Identity of Proofs,
ArXiv
A. Piccolomini d'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction, Synthèse Library, Springer, 2024;

Intensional harmony as isomorphism (with Luca Tranchini),
T. Piecha and K. Wehmeier (eds.), Peter SchroederHeister on ProofTheoretic Semantics, Outstanding Contributions to Logic, Springer, 2024;

On paradoxes in normal form (with Mattia Petrolo),
Topoi, 38(3), pp. 605617, 2019;
 A normal paradox (with Mattia Petrolo),
In Arazim, P. and Lávicka, T., editors, The Logica Yearbook 2016, p. 173184. College Publications, London, 2017;
 On the "nodeadlock criterion": from Herbrand's theorem to Geometry of Interaction,
New Developments in Logic and Philosophy of Science, SILFS series, College Publications, 2016;
 Rulefollowing and the limits of formalization: Wittgenstein's considerations through the lens of logic, preprint,
From Logic to Practice, Italian Studies in the Philosophy of Mathematics, volume 308 of Boston Studies in the Philosophy and History of Science, Springer, 2015;
 On transcendental syntax: a Kantian program for logic? (with V.M. Abrusci), preprint,
Second Pisa Colloquium in Logic, Epistemology and Philosophy of Language, ETS, Pisa, 2014;
 Dalle regole dell'argomentazione alla logica delle regole.
Rivista Italiana di Filosofia Analitica Junior, vol. 1 n. 2, pp. 2538, 2010.
Other stuff:
 On proofs and types in second order logic, my PhD thesis, PDF;
 Le direzioni della ricerca logica in Italia: la logica lineare e i suoi sviluppi (with V.M. Abrusci),
in Hykel Hosni, Gabriele Lolli, Carlo Toffalori, editors, Le direzioni della ricerca logica in Italia 2, p. 147, Edizioni ETS, Pisa, 2018;
 L'Hotel di Hilbert e l'imbarazzo della scelta (with Fabio Pasquali),
Archimede, vol. 1/2017, Le Monnier, 2017;
 La geometria dell'interazione, un paradigma monista per la logica, PDF.
Outreach: