Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Gianluca Curzi
Observed names:
Curzi, Gianluca,
Gianluca Curzi (19458249)
Institution:
University of Gothenburg
Observed institutions:
University of Sussex,
Université Paris Cité,
University of Turin,
University of Birmingham,
University of Gothenburg
ORCID:
0000-0001-8746-1704
Observed ORCID:
0000-0001-8746-1704
OpenAlex ID:
A5007571235
Computational expressivity of (circular) proofs with fixed points
2023
·
Gianluca Curzi
, Anupam Das
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
15
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
2023
·
Acclavio, Matteo
, Curzi, Gianluca
, et al.
·
arXiv (Cornell University)
·
12
PDF
Cyclic Implicit Complexity
2022
·
Gianluca Curzi
, Anupam Das
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
12
Trust Evidence Logic
2021
·
Alessandro Aldini
, Gianluca Curzi
, et al.
·
Lecture notes in computer science
·
12
A probabilistic modal logic for context-aware trust based on evidence
2024
·
Alessandro Aldini
, Gianluca Curzi
, et al.
·
International Journal of Approximate Reasoning
·
10
Infinitary Cut-Elimination via Finite Approximations
2024
·
Acclavio, Matteo
, Curzi, Gianluca
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Cyclic Implicit Complexity
2026
·
Gianluca Curzi
, Anupam Das
·
ACM Transactions on Computational Logic
·
5
PDF
A type-assignment of linear erasure and duplication
2020
·
Gianluca Curzi
, Luca Roversi
·
Theoretical Computer Science
·
3
Cyclic Proof Theory of Generalised Inductive Definitions
2025
·
Curzi, Gianluca
, Melgaard, Lukas
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Computational expressivity of (circular) proofs with fixed points
2025
·
Gianluca Curzi
, Anupam Das
·
Logical Methods in Computer Science
·
1
PDF
Probabilistic Soft Type Assignment
2020
·
Curzi, Gianluca
, Roversi, Luca
·
arXiv (Cornell University)
·
1
PDF
The Benefit of Being Non-Lazy in Probabilistic λ-calculus
2020
·
Gianluca Curzi
, Michele Pagani
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
1
PDF
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
2026
·
Curzi, Gianluca
, Leigh, Graham E.
·
arXiv (Cornell University)
PDF
Non-wellfounded parsimonious proofs and non-uniform complexity
2024
·
Acclavio, Matteo
, Curzi, Gianluca
, et al.
·
arXiv (Cornell University)
PDF
Non-Uniform Complexity via Non-Wellfounded Proofs
2022
·
Curzi, Gianluca
, Das, Anupam
·
arXiv (Cornell University)
PDF
Linear Additives
2021
·
Gianluca Curzi
·
Electronic Proceedings in Theoretical Computer Science
Non-laziness in Implicit Computational Complexity and Probabilistic Delta-calculus
2020
·
Gianluca Curzi
·
theses.fr (ABES)
Non-laziness in implicit computational complexity and probabilistic λ-calculus
2020
·
Gianluca Curzi
·
theses.fr (ABES)
PDF
Show more works
View as search
Works count:
20
Citation count:
82
H-index:
6
I10-index:
5
Year
Topic
Type