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, 2020)

The Benefit of Being Non-Lazy in Probabilistic λ-calculus. - Gianluca Curzi; Michele Pagani (CoRR, 2020)

Probabilistic Soft Type Assignment. - Gianluca Curzi; Luca Roversi (CoRR, 2020)

Linear Additives. - Gianluca Curzi (Linearity&TLLA@IJCAR-FSCD, 2020)

A type-assignment of linear erasure and duplication. - Gianluca Curzi; Luca Roversi (Theor. Comput. Sci., 2020)

Trust Evidence Logic. - Alessandro Aldini; Gianluca Curzi; Pierluigi Graziani; Mirko Tagliaferri (ECSQARU, 2021)

Cyclic Implicit Complexity. - Gianluca Curzi; Anupam Das 002 (LICS, 2022)

Non-Uniform Complexity via Non-Wellfounded Proofs. - Gianluca Curzi; Anupam Das 002 (CSL, 2023)

Computational expressivity of (circular) proofs with fixed points. - Gianluca Curzi; Anupam Das 002 (LICS, 2023)

Infinitary Cut-Elimination via Finite Approximations. - Matteo Acclavio; Gianluca Curzi; Giulio Guerrieri (CSL, 2024)

Non-wellfounded parsimonious proofs and non-uniform complexity. - Matteo Acclavio; Gianluca Curzi; Giulio Guerrieri (CoRR, 2024)

A probabilistic modal logic for context-aware trust based on evidence. - Alessandro Aldini; Gianluca Curzi; Pierluigi Graziani; Mirko Tagliaferri (Int. J. Approx. Reason., 2024)

Cyclic proof theory of positive inductive definitions. - Gianluca Curzi; Lukas Melgaard (CoRR, 2025)