default search action
Gianluca Curzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri:
A probabilistic modal logic for context-aware trust based on evidence. Int. J. Approx. Reason. 169: 109167 (2024) - [c7]Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri:
Infinitary Cut-Elimination via Finite Approximations. CSL 2024: 8:1-8:19 - [i8]Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri:
Non-wellfounded parsimonious proofs and non-uniform complexity. CoRR abs/2404.03311 (2024) - 2023
- [c6]Gianluca Curzi, Anupam Das:
Non-Uniform Complexity via Non-Wellfounded Proofs. CSL 2023: 16:1-16:18 - [c5]Gianluca Curzi, Anupam Das:
Computational expressivity of (circular) proofs with fixed points. LICS 2023: 1-13 - [i7]Gianluca Curzi, Anupam Das:
Computational expressivity of (circular) proofs with fixed points. CoRR abs/2302.14825 (2023) - [i6]Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri:
Infinitary cut-elimination via finite approximations. CoRR abs/2308.07789 (2023) - 2022
- [c4]Gianluca Curzi, Anupam Das:
Cyclic Implicit Complexity. LICS 2022: 19:1-19:13 - [i5]Gianluca Curzi, Anupam Das:
Non-uniform complexity via non-wellfounded proofs. CoRR abs/2211.16104 (2022) - 2021
- [c3]Alessandro Aldini, Gianluca Curzi, Pierluigi Graziani, Mirko Tagliaferri:
Trust Evidence Logic. ECSQARU 2021: 575-589 - [i4]Gianluca Curzi, Anupam Das:
Cyclic Implicit Complexity. CoRR abs/2110.01114 (2021) - 2020
- [j1]Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. Theor. Comput. Sci. 837: 26-53 (2020) - [c2]Gianluca Curzi, Michele Pagani:
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. LICS 2020: 327-340 - [c1]Gianluca Curzi:
Linear Additives. Linearity&TLLA@IJCAR-FSCD 2020: 74-93 - [i3]Gianluca Curzi, Michele Pagani:
The Benefit of Being Non-Lazy in Probabilistic λ-calculus. CoRR abs/2004.12891 (2020) - [i2]Gianluca Curzi, Luca Roversi:
Probabilistic Soft Type Assignment. CoRR abs/2007.01733 (2020)
2010 – 2019
- 2019
- [i1]Gianluca Curzi, Luca Roversi:
A type-assignment of linear erasure and duplication. CoRR abs/1912.12837 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint