Classical Proofs via Basic Logic. - Claudia Faggian (CSL, 1997)

A Term Calculus for Unitary Approach to Nomalization. - Claudia Faggian (ICFP, 1998)

Proof construction and non-commutativity: a cluster calculus. - Claudia Faggian (PPDP, 2000)

Basic Logic: Reflection, Symmetry, Visibility. - Giovanni Sambin; Giulia Battilotti; Claudia Faggian (J. Symb. Log., 2000)

Travelling on Designs. - Claudia Faggian (CSL, 2002)

Designs, Disputes and Strategies. - Claudia Faggian; Martin Hyland (CSL, 2002)

Interactive Observability in Ludics. - Claudia Faggian (ICALP, 2004)

L-Nets, Strategies and Proof-Nets. - Pierre-Louis Curien; Claudia Faggian (CSL, 2005)

Ludics Nets, a game Model of Concurrent Interaction. - Claudia Faggian; François Maurel (LICS, 2005)

Jump from Parallel to Sequential Proofs: Multiplicatives. - Paolo Di Giamberardino; Claudia Faggian (CSL, 2006)

A Graph Abstract Machine Describing Event Structure Composition. - Claudia Faggian; Mauro Piccolo (GT-VC@CONCUR, 2006)

Interactive observability in Ludics: The geometry of tests. - Claudia Faggian (Theor. Comput. Sci., 2006)

Ludics is a Model for the Finitary Linear Pi-Calculus. - Claudia Faggian; Mauro Piccolo (TLCA, 2007)

Proof nets sequentialisation in multiplicative linear logic. - Paolo Di Giamberardino; Claudia Faggian (Ann. Pure Appl. Log., 2008)

Partial Orders, Event Structures and Linear Strategies. - Claudia Faggian; Mauro Piccolo (TLCA, 2009)

Ludics with repetitions (Exponentials, Interactive types and Completeness) - Michele Basaldella; Claudia Faggian (Log. Methods Comput. Sci., 2011)

On Multiplicative Linear Logic, Modality and Quantum Circuits - Ugo Dal Lago; Claudia Faggian (QPL, 2011)

An approach to innocent strategies as graphs. - Pierre-Louis Curien; Claudia Faggian (Inf. Comput., 2012)

The geometry of synchronization. - Ugo Dal Lago; Claudia Faggian; Ichiro Hasuo; Akira Yoshimizu (CSL-LICS, 2014)

Measurements in Proof Nets as Higher-Order Quantum Circuits. - Akira Yoshimizu; Ichiro Hasuo; Claudia Faggian; Ugo Dal Lago (ESOP, 2014)

The Geometry of Synchronization (Long Version). - Ugo Dal Lago; Claudia Faggian; Ichiro Hasuo; Akira Yoshimizu (CoRR, 2014)

Parallelism and Synchronization in an Infinitary Context. - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (LICS, 2015)

Parallelism and Synchronization in an Infinitary Context (Long Version). - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (CoRR, 2015)

The geometry of parallelism: classical, probabilistic, and quantum effects. - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (POPL, 2017)

Probabilistic Rewriting: Relations between Normalization, Termination, and Unique Normal Forms. - Claudia Faggian (CoRR, 2018)

Factorization and Normalization, Essentially. - Beniamino Accattoli; Claudia Faggian; Giulio Guerrieri (APLAS, 2019)

Lambda Calculus and Probabilistic Computation. - Claudia Faggian; Simona Ronchi Della Rocca (LICS, 2019)

Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms. - Claudia Faggian (FSCD, 2019)

Solvability in a Probabilistic Setting (Invited Talk). - Simona Ronchi Della Rocca; Ugo Dal Lago; Claudia Faggian (FSCD, 2020)

Factorize Factorization. - Beniamino Accattoli; Claudia Faggian; Giulio Guerrieri (CSL, 2021)

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic. - Claudia Faggian; Giulio Guerrieri (FoSSaCS, 2021)

A Relational Theory of Monadic Rewriting Systems, Part I. - Francesco Gavazzo; Claudia Faggian (LICS, 2021)

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version). - Claudia Faggian; Giulio Guerrieri (CoRR, 2021)

Intersection types and (positive) almost-sure termination. - Ugo Dal Lago; Claudia Faggian; Simona Ronchi Della Rocca (Proc. ACM Program. Lang., 2021)

Strategies for Asymptotic Normalization. - Claudia Faggian; Giulio Guerrieri (FSCD, 2022)

Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms. - Claudia Faggian (Log. Methods Comput. Sci., 2022)

On reduction and normalization in the computational core. - Claudia Faggian; Giulio Guerrieri; Ugo de'Liguoro; Riccardo Treglia (Math. Struct. Comput. Sci., 2022)

Asymptotic Rewriting (Invited Talk). - Claudia Faggian (CSL, 2023)

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (FSCD, 2023)

Normal Form Bisimulations By Value. - Beniamino Accattoli; Claudia Faggian; Adrienne Lancelot (CoRR, 2023)

Higher-Order Bayesian Networks, Exactly (Extended version). - Claudia Faggian; Daniele Pautasso; Gabriele Vanoni (CoRR, 2023)

A Rewriting Theory for Quantum Lambda-Calculus. - Claudia Faggian; Gaetan Lopez; Benoît Valiron (CoRR, 2024)

Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (CoRR, 2024)

Higher Order Bayesian Networks, Exactly. - Claudia Faggian; Daniele Pautasso; Gabriele Vanoni (Proc. ACM Program. Lang., 2024)

A Rewriting Theory for Quantum λ-Calculus. - Claudia Faggian; Gaetan Lopez; Benoît Valiron (CSL, 2025)

Variable Elimination as Rewriting in a Linear Lambda Calculus. - Thomas Ehrhard; Claudia Faggian; Michele Pagani (ESOP (1), 2025)