Journal papers
Cyclic Implicit Complexity
Joint work with Anupam Das. ACM Transactions on Computational Logic (TOCL) 2026 (pdf)
Computational expressivity of (circular) proofs with fixed points
Joint work with Anupam Das. Logical Methods in Computer Science (LMCS) 2025 (pdf)
A probabilistic modal logic for context-aware trust based on evidence
Joint work with Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri. International Journal of
Approximate Reasoning 2024 (pdf)
Linear additives
Proceedings of TLLA 2020 (pdf)
A type-assignment of linear erasure and duplication
Joint work with Luca Roversi. Theoretical Computer Science 2020 (pdf)
Conference Proceedings
Cyclic Proof Theory of Generalised Inductive Definitions
Joint work with Lukas Melgaard. CSL 2026 (pdf)
Infinitary cut-elimination via finite approximations
Joint work with Matteo Acclavio and Giulio Guerrieri. CSL 2024 (pdf)
Non-uniform complexity via non-wellfounded proofs
Joint work with Anupam Das. CSL 2023 (pdf)
Computational expressivity of (circular) proofs with fixed points
Joint work with Anupam Das. LICS 2023 (pdf)
Cyclic Implicit Complexity
Joint work with Anupam Das. LICS 2022 (pdf)
Trust Evidence Logic
Joint work with Alessandro Aldini, Pierluigi Graziani, and Mirko Tagliaferri. ECSQARU 2021 (pdf)
The benefit of being non-lazy in probabilistic λ-calculus
Joint work with Michele Pagani. LICS 2020 (pdf)
Unpublished and submitted papers
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
Joint work Graham Leigh. Preprint available on Arxiv (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)