29 citations · 81 across the 22 of their papers we have counts for
25 papers
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…
Integration in Cones
Thomas Ehrhard, Guillaume Geoffroy
Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous…
A coherent differential PCF
Thomas Ehrhard
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as…
Coherent differentiation
Thomas Ehrhard
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as…
Categorical models of Linear Logic with fixed points of formulas
Thomas Ehrhard, Farzad Jafarrahmani
We develop a denotational semantics of muLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional muMALL with exponen…