24 citations · 79 across the 15 of their papers we have counts for
20 papers
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Rémi Di Guardia, Thomas Ehrhard, Claudia Faggian
Quantum Bayesian networks provide a mathematical formalism to describe causal relations, to analyse correlations, and to predict the probabilities of measurement outcomes, in syste…
Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
Rémi Di Guardia, Thomas Ehrhard, Jérôme Evrard +1
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical ac…
Variable Elimination as Rewriting in a Linear Lambda Calculus
Thomas Ehrhard, Claudia Faggian, Michele Pagani
Variable Elimination (VE) is a classical exact inference algorithm for probabilistic graphical models such as Bayesian Networks, computing the marginal distribution of a subset of…
Bayesian Networks and Proof-Nets: a proof-theoretical account of Bayesian Inference
Thomas Ehrhard, Claudia Faggian, Michele Pagani
We uncover a strong correspondence between Bayesian Networks and (Multiplicative) Linear Logic Proof-Nets, relating the two as a representation of a joint probability distribution…
A Rewriting Theory for Quantum Lambda-Calculus
Claudia Faggian, Gaetan Lopez, Benoît Valiron
Quantum lambda calculus has been studied mainly as an idealized programming language -- the evaluation essentially corresponds to a deterministic abstract machine. Very little work…
Higher-Order Bayesian Networks, Exactly (Extended version)
Claudia Faggian, Daniele Pautasso, Gabriele Vanoni
Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inferenc…
Normal Form Bisimulations By Value
Beniamino Accattoli, Adrienne Lancelot, Claudia Faggian
Normal form bisimilarities are a natural form of program equivalence resting on open terms, first introduced by Sangiorgi in call-by-name. The literature contains a normal form bis…
Strategies for Asymptotic Normalization
Claudia Faggian, Giulio Guerrieri
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of s…
On reduction and normalization in the computational core
Claudia Faggian, Giulio Guerrieri, Ugo de'Liguoro +1
We study the reduction in a lambda-calculus derived from Moggi's computational one, that we call the computational core. The reduction relation consists of rules obtained by orient…
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)
Claudia Faggian, Giulio Guerrieri
In each variant of the lambda-calculus, factorization and normalization are two key-properties that show how results are computed. Instead of proving factorization/normalization fo…
Intersection Types and (Positive) Almost-Sure Termination
Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice…
Factorize Factorization
Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization the…
Factorization and Normalization, Essentially
Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as…
Lambda Calculus and Probabilistic Computation
Claudia Faggian, Simona Ronchi della Rocca
We introduce two extensions of the -calculus with a probabilistic choice operator, and , modeling respectively call-by-value and call-by-name pr…
Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms
Claudia Faggian
While a mature body of work supports the study of rewriting systems, abstract tools for Probabilistic Rewriting are still limited. In this paper we study the question of uniqueness…
The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects
Ugo Dal Lago, Claudia Faggian, Benoit Valiron +1
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication…
Parallelism and Synchronization in an Infinitary Context (Long Version)
Ugo Dal Lago, Claudia Faggian, Benoit Valiron +1
We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints and synchronization. The advantage of such machines is to p…
The Geometry of Synchronization (Long Version)
Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo +1
We graft synchronization onto Girard's Geometry of Interaction in its most concrete form, namely token machines. This is realized by introducing proof-nets for SMLL, an extension o…
On Multiplicative Linear Logic, Modality and Quantum Circuits
Ugo Dal Lago, Claudia Faggian
A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through…
Ludics with repetitions (Exponentials, Interactive types and Completeness)
Claudia Faggian, Michele Basaldella
Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behav…