Gianluca Curzi
About Gianluca Curzi
I am currently a postdoc at the Department of Philosophy, Linguistics, Theory of Science of the University of Gothenburg (Sweden), working within the research project Taming Jörmungandr: The Logical Foundations of Circularity, under the supervision of Graham Leigh. I was previously a Research Fellow at the School of Computer Science of the University of Birmingham (UK), under the supervision of Anupam Das. I earned a PhD in Computer Science in June 2020 at the University of Turin (Italy), in joint thesis (“cotutelle”) with Paris Diderot University (France).
My research interests range from proof theory, linear logic, lambda calculus and type theories to computational complexity, coinduction, and probabilistic computation. I am now working on the computational strength of circular proofs, with special attention to their complexity-theoretic aspects.
For more information see my personal webpage.
-
Computational expressivity of (circular) proofs with fixed
points
Gianluca Curzi, Anupam Das
LICS - 2023 -
Non-Uniform Complexity via Non-Wellfounded
Proofs
Gianluca Curzi, Anupam Das
CSL - 2023 -
Cyclic Implicit
Complexity
Gianluca Curzi, Anupam Das
LICS - 2022 -
Linear
Additives
Gianluca Curzi
Electronic Proceedings in Theoretical Computer Science (EPTCS) - 2021 -
Trust Evidence
Logic
Gianluca Curzi, Alessandro Aldini, Pierluigi Graziani, Mirko Tagliaferri
ECSQARU - 2021 -
A type-assignment of linear erasure and
duplication
Gianluca Curzi, Luca Roversi
Theoretical Computer Science - 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
LICS - 2020