Claudia Faggian

Orcid: 0009-0009-8875-3595

According to our database1, Claudia Faggian authored at least 42 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Higher Order Bayesian Networks, Exactly.
Proc. ACM Program. Lang., January, 2024

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

Normal Form Bisimulations By Value.
CoRR, 2023

The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Asymptotic Rewriting (Invited Talk).
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
On reduction and normalization in the computational core.
Math. Struct. Comput. Sci., August, 2022

Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms.
Log. Methods Comput. Sci., 2022

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

2021
Intersection types and (positive) almost-sure termination.
Proc. ACM Program. Lang., 2021

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

A Relational Theory of Monadic Rewriting Systems, Part I.
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.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

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

2020
Solvability in a Probabilistic Setting (Invited Talk).
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Lambda Calculus and Probabilistic Computation.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Factorization and Normalization, Essentially.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

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

2017
The geometry of parallelism: classical, probabilistic, and quantum effects.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

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

Parallelism and Synchronization in an Infinitary Context.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
The Geometry of Synchronization (Long Version).
CoRR, 2014

Measurements in Proof Nets as Higher-Order Quantum Circuits.
Proceedings of the Programming Languages and Systems, 2014

The geometry of synchronization.
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.
Inf. Comput., 2012

2011
On Multiplicative Linear Logic, Modality and Quantum Circuits
Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

Ludics with repetitions (Exponentials, Interactive types and Completeness)
Log. Methods Comput. Sci., 2011

2009
Partial Orders, Event Structures and Linear Strategies.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2008
Proof nets sequentialisation in multiplicative linear logic.
Ann. Pure Appl. Log., 2008

2007
Ludics is a Model for the Finitary Linear Pi-Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006
Interactive observability in Ludics: The geometry of tests.
Theor. Comput. Sci., 2006

A Graph Abstract Machine Describing Event Structure Composition.
Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, 2006

Jump from Parallel to Sequential Proofs: Multiplicatives.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Ludics Nets, a game Model of Concurrent Interaction.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

L-Nets, Strategies and Proof-Nets.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
Interactive Observability in Ludics.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2002
Designs, Disputes and Strategies.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Travelling on Designs.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2000
Basic Logic: Reflection, Symmetry, Visibility.
J. Symb. Log., 2000

Proof construction and non-commutativity: a cluster calculus.
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.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1997
Classical Proofs via Basic Logic.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997


  Loading...