Claudia Faggian

According to our database, Claudia Faggian authored at least 46 papers between 1997 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Variable Elimination as Rewriting in a Linear Lambda Calculus.

Thomas Ehrhard, Claudia Faggian, Michele Pagani

Proceedings of the Programming Languages and Systems, 2025

A Rewriting Theory for Quantum λ-Calculus.

Claudia Faggian, Gaetan Lopez, Benoît Valiron

Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025

2024

Higher Order Bayesian Networks, Exactly.

Claudia Faggian, Daniele Pautasso, Gabriele Vanoni

Proc. ACM Program. Lang., January, 2024

Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference.

Thomas Ehrhard, Claudia Faggian, Michele Pagani

CoRR, 2024

A Rewriting Theory for Quantum Lambda-Calculus.

Claudia Faggian, Gaetan Lopez, Benoît Valiron

CoRR, 2024

2023

Higher-Order Bayesian Networks, Exactly (Extended version).

Claudia Faggian, Daniele Pautasso, Gabriele Vanoni

CoRR, 2023

Normal Form Bisimulations By Value.

Beniamino Accattoli, Claudia Faggian, Adrienne Lancelot

CoRR, 2023

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic.

Thomas Ehrhard, Claudia Faggian, Michele Pagani

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Asymptotic Rewriting (Invited Talk).

Claudia Faggian

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

On reduction and normalization in the computational core.

Claudia Faggian, Giulio Guerrieri, Ugo de'Liguoro, Riccardo Treglia

Math. Struct. Comput. Sci., August, 2022

Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms.

Claudia Faggian

Log. Methods Comput. Sci., 2022

Strategies for Asymptotic Normalization.

Claudia Faggian, Giulio Guerrieri

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Intersection types and (positive) almost-sure termination.

Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca

Proc. ACM Program. Lang., 2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version).

Claudia Faggian, Giulio Guerrieri

CoRR, 2021

A Relational Theory of Monadic Rewriting Systems, Part I.

Francesco Gavazzo, Claudia Faggian

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic.

Claudia Faggian, Giulio Guerrieri

Proceedings of the Foundations of Software Science and Computation Structures, 2021

Factorize Factorization.

Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Solvability in a Probabilistic Setting (Invited Talk).

Simona Ronchi Della Rocca, Ugo Dal Lago, Claudia Faggian

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms.

Claudia Faggian

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Lambda Calculus and Probabilistic Computation.

Claudia Faggian, Simona Ronchi Della Rocca

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Factorization and Normalization, Essentially.

Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

Probabilistic Rewriting: Relations between Normalization, Termination, and Unique Normal Forms.

Claudia Faggian

CoRR, 2018

2017

The geometry of parallelism: classical, probabilistic, and quantum effects.

Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

2015

Parallelism and Synchronization in an Infinitary Context (Long Version).

Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu

CoRR, 2015

Parallelism and Synchronization in an Infinitary Context.

Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

The Geometry of Synchronization (Long Version).

Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu

CoRR, 2014

Measurements in Proof Nets as Higher-Order Quantum Circuits.

Akira Yoshimizu, Ichiro Hasuo, Claudia Faggian, Ugo Dal Lago

Proceedings of the Programming Languages and Systems, 2014

The geometry of synchronization.

Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2012

An approach to innocent strategies as graphs.

Pierre-Louis Curien, Claudia Faggian

Inf. Comput., 2012

2011

On Multiplicative Linear Logic, Modality and Quantum Circuits

Ugo Dal Lago, Claudia Faggian

Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

2009

Partial Orders, Event Structures and Linear Strategies.

Claudia Faggian, Mauro Piccolo

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Ludics with Repetitions (Exponentials, Interactive Types and Completeness).

Michele Basaldella, Claudia Faggian

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

Proof nets sequentialisation in multiplicative linear logic.

Paolo Di Giamberardino, Claudia Faggian

Ann. Pure Appl. Log., 2008

2007

Ludics is a Model for the Finitary Linear Pi-Calculus.

Claudia Faggian, Mauro Piccolo

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006

Interactive observability in Ludics: The geometry of tests.

Claudia Faggian

Theor. Comput. Sci., 2006

A Graph Abstract Machine Describing Event Structure Composition.

Claudia Faggian, Mauro Piccolo

Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, 2006

Jump from Parallel to Sequential Proofs: Multiplicatives.

Paolo Di Giamberardino, Claudia Faggian

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Ludics Nets, a game Model of Concurrent Interaction.

Claudia Faggian, François Maurel

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

L-Nets, Strategies and Proof-Nets.

Pierre-Louis Curien, Claudia Faggian

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004

Interactive Observability in Ludics.

Claudia Faggian

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2002

Designs, Disputes and Strategies.

Claudia Faggian, Martin Hyland

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Travelling on Designs.

Claudia Faggian

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2000

Basic Logic: Reflection, Symmetry, Visibility.

Giovanni Sambin, Giulia Battilotti, Claudia Faggian

J. Symb. Log., 2000

Proof construction and non-commutativity: a cluster calculus.

Claudia Faggian

Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

1998

A Term Calculus for Unitary Approach to Nomalization.

Claudia Faggian

Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1997

Classical Proofs via Basic Logic.

Claudia Faggian

Proceedings of the Computer Science Logic, 11th International Workshop, 1997