default search action
Claudia Faggian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Claudia Faggian
, Daniele Pautasso
Higher Order Bayesian Networks, Exactly. Proc. ACM Program. Lang. 8(POPL): 2514-2546 (2024) - 2023
- [c28]Claudia Faggian:
Asymptotic Rewriting (Invited Talk). CSL 2023: 1:1-1:2 - [c27]Thomas Ehrhard, Claudia Faggian, Michele Pagani
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. FSCD 2023: 8:1-8:18 - [i13]Beniamino Accattoli, Claudia Faggian, Adrienne Lancelot:
Normal Form Bisimulations By Value. CoRR abs/2303.08161 (2023) - [i12]Claudia Faggian, Daniele Pautasso
Higher-Order Bayesian Networks, Exactly (Extended version). CoRR abs/2311.04651 (2023) - 2022
- [j8]Claudia Faggian:
Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms. Log. Methods Comput. Sci. 18(2) (2022) - [j7]Claudia Faggian, Giulio Guerrieri
On reduction and normalization in the computational core. Math. Struct. Comput. Sci. 32(7): 934-981 (2022) - [c26]Claudia Faggian, Giulio Guerrieri
Strategies for Asymptotic Normalization. FSCD 2022: 17:1-17:24 - [i11]Claudia Faggian, Giulio Guerrieri:
Strategies for Asymptotic Normalization. CoRR abs/2204.08772 (2022) - 2021
- [j6]Ugo Dal Lago
Intersection types and (positive) almost-sure termination. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [c25]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Factorize Factorization. CSL 2021: 6:1-6:25 - [c24]Claudia Faggian, Giulio Guerrieri
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic. FoSSaCS 2021: 205-225 - [c23]Francesco Gavazzo
A Relational Theory of Monadic Rewriting Systems, Part I. LICS 2021: 1-14 - [i10]Claudia Faggian, Giulio Guerrieri:
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version). CoRR abs/2101.08364 (2021) - [i9]Claudia Faggian, Giulio Guerrieri, Ugo de'Liguoro, Riccardo Treglia:
On reduction and normalization in the computational core. CoRR abs/2104.10267 (2021) - 2020
- [c22]Simona Ronchi Della Rocca, Ugo Dal Lago, Claudia Faggian:
Solvability in a Probabilistic Setting (Invited Talk). FSCD 2020: 1:1-1:17 - [i8]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorize Factorization. CoRR abs/2005.01808 (2020) - [i7]Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca:
Intersection Types and (Positive) Almost-Sure Termination. CoRR abs/2010.12689 (2020)
2010 – 2019
- 2019
- [c21]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Factorization and Normalization, Essentially. APLAS 2019: 159-180 - [c20]Claudia Faggian, Simona Ronchi Della Rocca:
Lambda Calculus and Probabilistic Computation. LICS 2019: 1-13 - [c19]Claudia Faggian:
Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms. FSCD 2019: 19:1-19:25 - [i6]Claudia Faggian, Simona Ronchi Della Rocca:
Lambda Calculus and Probabilistic Computation. CoRR abs/1901.02853 (2019) - [i5]Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri:
Factorization and Normalization, Essentially. CoRR abs/1908.11289 (2019) - 2018
- [i4]Claudia Faggian:
Probabilistic Rewriting: Relations between Normalization, Termination, and Unique Normal Forms. CoRR abs/1804.05578 (2018) - 2017
- [c18]Ugo Dal Lago
The geometry of parallelism: classical, probabilistic, and quantum effects. POPL 2017: 833-845 - 2016
- [i3]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects. CoRR abs/1610.09629 (2016) - 2015
- [c17]Ugo Dal Lago
Parallelism and Synchronization in an Infinitary Context. LICS 2015: 559-572 - [i2]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
Parallelism and Synchronization in an Infinitary Context (Long Version). CoRR abs/1505.03635 (2015) - 2014
- [c16]Ugo Dal Lago
The geometry of synchronization. CSL-LICS 2014: 35:1-35:10 - [c15]Akira Yoshimizu, Ichiro Hasuo, Claudia Faggian, Ugo Dal Lago
Measurements in Proof Nets as Higher-Order Quantum Circuits. ESOP 2014: 371-391 - [i1]Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu:
The Geometry of Synchronization (Long Version). CoRR abs/1405.3427 (2014) - 2012
- [j5]Pierre-Louis Curien, Claudia Faggian:
An approach to innocent strategies as graphs. Inf. Comput. 214: 119-155 (2012) - 2011
- [j4]Michele Basaldella, Claudia Faggian:
Ludics with repetitions (Exponentials, Interactive types and Completeness). Log. Methods Comput. Sci. 7(2) (2011) - [c14]Ugo Dal Lago, Claudia Faggian:
On Multiplicative Linear Logic, Modality and Quantum Circuits. QPL 2011: 55-66
2000 – 2009
- 2009
- [c13]Michele Basaldella, Claudia Faggian:
Ludics with Repetitions (Exponentials, Interactive Types and Completeness). LICS 2009: 375-384 - [c12]Claudia Faggian, Mauro Piccolo:
Partial Orders, Event Structures and Linear Strategies. TLCA 2009: 95-111 - 2008
- [j3]Paolo Di Giamberardino, Claudia Faggian:
Proof nets sequentialisation in multiplicative linear logic. Ann. Pure Appl. Log. 155(3): 173-182 (2008) - 2007
- [c11]Claudia Faggian, Mauro Piccolo:
Ludics is a Model for the Finitary Linear Pi-Calculus. TLCA 2007: 148-162 - 2006
- [j2]Claudia Faggian:
Interactive observability in Ludics: The geometry of tests. Theor. Comput. Sci. 350(2-3): 213-233 (2006) - [c10]Paolo Di Giamberardino, Claudia Faggian:
Jump from Parallel to Sequential Proofs: Multiplicatives. CSL 2006: 319-333 - [c9]Claudia Faggian, Mauro Piccolo:
A Graph Abstract Machine Describing Event Structure Composition. GT-VC@CONCUR 2006: 21-36 - 2005
- [c8]Pierre-Louis Curien, Claudia Faggian:
L-Nets, Strategies and Proof-Nets. CSL 2005: 167-183 - [c7]Claudia Faggian, François Maurel:
Ludics Nets, a game Model of Concurrent Interaction. LICS 2005: 376-385 - 2004
- [c6]Claudia Faggian:
Interactive Observability in Ludics. ICALP 2004: 506-518 - 2002
- [c5]Claudia Faggian:
Travelling on Designs. CSL 2002: 427-441 - [c4]Claudia Faggian, Martin Hyland:
Designs, Disputes and Strategies. CSL 2002: 442-457 - 2000
- [j1]Giovanni Sambin, Giulia Battilotti, Claudia Faggian:
Basic Logic: Reflection, Symmetry, Visibility. J. Symb. Log. 65(3): 979-1013 (2000) - [c3]Claudia Faggian:
Proof construction and non-commutativity: a cluster calculus. PPDP 2000: 80-91
1990 – 1999
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:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: