64 citations · 159 across the 14 of their papers we have counts for
6 papers · 1 filter
Scoped Effects as Parameterized Algebraic Theories
Cristina Matache, Sam Lindley, Sean Moss +3
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are…
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar +5
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-beh…
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…
Denotational validation of higher-order Bayesian inference
Adam Ścibior, Ohad Kammar, Matthijs Vákár +7
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inferenc…
A monad for full ground reference cells
Ohad Kammar, Paul B. Levy, Sean K. Moss +1
We present a denotational account of dynamic allocation of potentially cyclic memory cells using a monad on a functor category. We identify the collection of heaps as an object in…