Gianluca Curzi

21 papers A* 3B 3C 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2026 B conf
Cyclic Proof Theory of Generalised Inductive Definitions.
CSL
Gianluca Curzi, Lukas Melgaard
2026 J jnl
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm.
CoRR
Gianluca Curzi, Graham E. Leigh
2025 J jnl
Computational expressivity of (circular) proofs with fixed points.
Log. Methods Comput. Sci.
Gianluca Curzi, Anupam Das
2025 J jnl
Cyclic proof theory of positive inductive definitions.
CoRR
Gianluca Curzi, Lukas Melgaard
2024 J jnl
A probabilistic modal logic for context-aware trust based on evidence.
Int. J. Approx. Reason.
Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri
2024 B conf
Infinitary Cut-Elimination via Finite Approximations.
CSL
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
2024 J jnl
Non-wellfounded parsimonious proofs and non-uniform complexity.
CoRR
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
2023 A* conf
Computational expressivity of (circular) proofs with fixed points.
LICS
Gianluca Curzi, Anupam Das
2023 J jnl
Computational expressivity of (circular) proofs with fixed points.
CoRR
Gianluca Curzi, Anupam Das
2023 J jnl
Infinitary cut-elimination via finite approximations.
CoRR
Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri
2023 B conf
Non-Uniform Complexity via Non-Wellfounded Proofs.
CSL
Gianluca Curzi, Anupam Das
2022 A* conf
Cyclic Implicit Complexity.
LICS
Gianluca Curzi, Anupam Das
2022 J jnl
Non-uniform complexity via non-wellfounded proofs.
CoRR
Gianluca Curzi, Anupam Das
2021 J jnl
Cyclic Implicit Complexity.
CoRR
Gianluca Curzi, Anupam Das
2021 C conf
Trust Evidence Logic.
ECSQARU
Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri
2020 J jnl
A type-assignment of linear erasure and duplication.
Theor. Comput. Sci.
Gianluca Curzi, Luca Roversi
2020 — conf
Linear Additives.
Linearity&TLLA@IJCAR-FSCD
Gianluca Curzi
2020 J jnl
Probabilistic Soft Type Assignment.
CoRR
Gianluca Curzi, Luca Roversi
2020 J jnl
The Benefit of Being Non-Lazy in Probabilistic λ-calculus.
CoRR
Gianluca Curzi, Michele Pagani
2020 A* conf
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name.
LICS
Gianluca Curzi, Michele Pagani
2019 J jnl
A type-assignment of linear erasure and duplication.
CoRR
Gianluca Curzi, Luca Roversi