Computational expressivity of (circular) proofs with fixed points
Joint work with Anupam Das. Proceedings of LICS 2023 (pdf).
Non-uniform complexity via non-wellfounded proofs
Joint work with Anupam Das. Proceedings of CSL 2023 (pdf and slides).
Cyclic Implicit Complexity
Joint work with Anupam Das. Proceedings of LICS 2022 (pdf and slides).
Trust Evidence Logic
Joint work with Alessandro Aldini, Pierluigi Graziani, and Mirko Tagliaferri.
Proceedings of ECSQARU 2021 (pdf).
A type-assignment of linear erasure and duplication
Joint work with Luca Roversi. Theoretical Computer Science 2020 (pdf).
The benefit of being non-lazy in probabilistic λ-calculus
Joint work with Michele Pagani. Proceedings of LICS 2020 (pdf and slides).
Proceedings of TLLA 2020 (pdf and slides).
Unpublished and submitted papers
Infinitary cut-elimination via finite approximations
Joint work with Matteo Acclavio and Giulio Guerrieri. Submitted to CSL 2024 (pdf).
Non-uniform polynomial time via non-wellfounded parsimonious proofs
Joint work with Matteo Acclavio and Giulio Guerrieri. (pdf).
Probabilistic Soft Type Assignment
Joint work with Luca Roversi. (pdf).
Non-Laziness in Implicit Computational Complexity and Probabilistic λ-calculus
Supervisor Luca Roversi, co-supervisor Michele Pagani (pdf and slides).