Gianluca Curzi

According to our database, Gianluca Curzi authored at least 13 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Cyclic proof theory of positive inductive definitions.

Gianluca Curzi, Lukas Melgaard

CoRR, July, 2025

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

Non-wellfounded parsimonious proofs and non-uniform complexity.

Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri

CoRR, 2024

Infinitary Cut-Elimination via Finite Approximations.

Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Computational expressivity of (circular) proofs with fixed points.

Gianluca Curzi, Anupam Das

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Non-Uniform Complexity via Non-Wellfounded Proofs.

Gianluca Curzi, Anupam Das

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

Cyclic Implicit Complexity.

Gianluca Curzi, Anupam Das

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Trust Evidence Logic.

Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

2020

A type-assignment of linear erasure and duplication.

Gianluca Curzi, Luca Roversi

Theor. Comput. Sci., 2020

Linear Additives.

Gianluca Curzi

Proceedings of the Proceedings Second Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2020

Probabilistic Soft Type Assignment.

Gianluca Curzi, Luca Roversi

CoRR, 2020

The Benefit of Being Non-Lazy in Probabilistic λ-calculus.

Gianluca Curzi, Michele Pagani

CoRR, 2020

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

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020