| Trust evidence logic A Aldini, G Curzi, P Graziani, M Tagliaferri Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th …, 2021 | 14 | 2021 |
| Cyclic implicit complexity G Curzi, A Das Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 11 | 2022 |
| Non-uniform complexity via non-wellfounded proofs G Curzi, A Das arXiv preprint arXiv:2211.16104, 2022 | 8 | 2022 |
| Infinitary cut-elimination via finite approximations M Acclavio, G Curzi, G Guerrieri 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), 2024 | 6 | 2024 |
| The benefit of being non-lazy in probabilistic λ-calculus: Applicative bisimulation is fully abstract for non-lazy probabilistic call-by-name G Curzi, M Pagani Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 3 | 2020 |
| Computational expressivity of (circular) proofs with fixed points G Curzi, A Das 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023 | 2 | 2023 |
| Infinitary cut-elimination via finite approximations (extended version) M Acclavio, G Curzi, G Guerrieri CoRR, abs/2308.07789, 2023 | 2 | 2023 |
| A type-assignment of linear erasure and duplication G Curzi, L Roversi Theoretical Computer Science 837, 26-53, 2020 | 2 | 2020 |
| Probabilistic Soft Type Assignment G Curzi, L Roversi arXiv preprint arXiv:2007.01733, 2020 | 2 | 2020 |
| Non-uniform polynomial time via non-wellfounded parsimonious proofs M Acclavio, G Curzi, G Guerrieri Unpublished. URL: http://gianlucacurzi. com/Non-uniform-polynomial-time-via …, 0 | 2 | |
| A probabilistic modal logic for context-aware trust based on evidence A Aldini, G Curzi, P Graziani, M Tagliaferri International Journal of Approximate Reasoning 169, 109167, 2024 | 1 | 2024 |
| Linear additives G Curzi arXiv preprint arXiv:2104.13739, 2021 | 1 | 2021 |
| Non-wellfounded parsimonious proofs and non-uniform complexity M Acclavio, G Curzi, G Guerrieri arXiv preprint arXiv:2404.03311, 2024 | | 2024 |
| 31st EACSL Annual Conference on Computer Science Logic (CSL 2023) C Faggian, N Gierasimczuk, D Miller, JH Wu, D Sangiorgi, B Afshari, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| Non-Laziness in Implicit Computational Complexity and Probabilistic-calculus G Curzi Università degli Studi di Torino, 2020 | | 2020 |
| Non-Laziness in Implicit Computational Complexity and Probabilistic λ-calculus G Curzi Université Paris Cité, 2020 | | 2020 |
| Logic Colloquium 2024 M Acclavio, G Curzi, G Guerrieri | | |
| Non-Uniform Polynomial Time and Non-Wellfounded Parsimonious Proofs M Acclavio, G Curzi, G Guerrieri | | |
| Towards Cyclic Implicit Complexity G Curzi, A Das | | |
