24 citations · 38 across the 4 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2023★ 1 cited
PAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs
Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka +1
We introduce a new setting, the category of PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is ge…
cs.PL2021★ 5 cited
Monads for Measurable Queries in Probabilistic Databases
Swaraj Dash, Sam Staton
We consider a bag (multiset) monad on the category of standard Borel spaces, and show that it gives a free measurable commutative monoid. Firstly, we show that a recent measurabili…
cs.PL2014★ 24 cited
Linear usage of state
Rasmus Ejlers Møgelberg, Sam Staton
We investigate the phenomenon that "every monad is a linear state monad". We do this by studying a fully-complete state-passing translation from an impure call-by-value language to…