Gianluca Curzi

Orcid: 0000-0001-8746-1704

According to our database1, Gianluca Curzi authored at least 12 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A probabilistic modal logic for context-aware trust based on evidence.
Int. J. Approx. Reason., 2024

Non-wellfounded parsimonious proofs and non-uniform complexity.
CoRR, 2024

Infinitary Cut-Elimination via Finite Approximations.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Computational expressivity of (circular) proofs with fixed points.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Non-Uniform Complexity via Non-Wellfounded Proofs.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

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

2021
Trust Evidence Logic.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2021

2020
A type-assignment of linear erasure and duplication.
Theor. Comput. Sci., 2020

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

Probabilistic Soft Type Assignment.
CoRR, 2020

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

The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020


  Loading...