Dipartimento di Informatica - Scienza e Ingegneria
Università degli Studi di Bologna
Mura Anteo Zamboni, 7
40127 Bologna, Italy
tel: (+33)6 84 25 71 91
I'm currently an assistant researcher in Bologna, Italy. I did my PhD in Marseille, following by a year as ATER (temporary assistant to research and teaching) in Paris 7.
My primary research topic is probabilistic λ-calculus. I studied the notion of equational theory in probabilistic calculi, and I've been looking at the theories induced by different models (Böhm trees, probabilistic coherence spaces, Taylor expansions...).
My thesis, Probabilistic λ-Theories, is available on Hal.
- Thomas Leventis, A Deterministic Rewrite System for the Probabilistic λ-Calculus, to appear in Mathematical Structures in Computer Science. (pdf).
- Thomas Leventis. Probabilistic Böhm Trees and Probabilistic Separation, Logic in Computer Science, 2018. (doi).
- Thomas Leventis, Michele Pagani. Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces, Foundations of Software Science and Computation Structures, 2019.
- Ugo dal Lago, Thomas Leventis. On the Taylor Expansion of Probabilistic Lambda-Terms, to appear in International Conference on Formal Structures for Computation and Deduction, 2019
- First work on implicit complexity, 2011 (pdf).
- Models of the λ-calculus, or how I learned to like λ-theories, 2012 (pdf).
- A raw Coq proof of soudness for relaxing some restriction on the typing of references in OCaml, following this article (files).
- Probabilistic separation, the foundations of my thesis, 2013 (pdf).