64 citations · 92 across the 6 of their papers we have counts for
8 papers · 1 filter
Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction)
Cristina Matache, Sean Moss, Sam Staton
We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such a…
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…
Probabilistic Programming Semantics for Name Generation
Marcin Sabok, Sam Staton, Dario Stein +1
We make a formal analogy between random sampling and fresh name generation. We show that quasi-Borel spaces, a model for probabilistic programming, can soundly interpret Stark's $ν…
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing
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 characte…