64 citations · 124 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
Recursion and Sequentiality in Categories of Sheaves
Cristina Matache, Sean Moss, Sam Staton
We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired…
Compositional Semantics for Probabilistic Programs with Exact Conditioning
Dario Stein, Sam Staton
We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational and equational seman…
A Monad for Probabilistic Point Processes
Swaraj Dash, Sam Staton
A point process on a space is a random bag of elements of that space. In this paper we explore programming with point processes in a monadic style. To this end we identify point pr…
Higher Order Automatic Differentiation of Higher Order Functions
Mathieu Huot, Sam Staton, Matthijs Vákár
We present semantic correctness proofs of automatic differentiation (AD). We consider a forward-mode AD method on a higher-order language with algebraic data types and we character…