2 citations · 3 across the 13 of their papers we have counts for
13 papers
Cambria: Resource Abstraction for Parametrized Algebraic Effects and Handlers
Jack Liell-Cock, Sam Staton
The algebraic effects and handlers paradigm separates the concerns of the interface and implementation of computational effects in programming languages. We present Cambria, a lang…
Hippogriff: a semantic approach to uniting core and modules
Owen Lynch, Sam Staton
In this paper we introduce Hippogriff, a language with a module system that unifies syntax between the core level and the module level. Hippogriff's type theory is dependent, with…
Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl)
Jack Liell-Cock, Sam Staton
Imprecise probability generalizes standard probability theory by replacing a single distribution with a convex set of possible distributions. We show that this generalization requi…
Clock systems for stochastic and non-deterministic categorical systems theories
Owen Lynch, David Jaz Myers, Eigil Fjeldgren Rischel +1
One of the characteristic features of categorical systems theory is that the behavior of systems can be characterized by certain morphisms into them. In other words, behaviors form…
Likelihood Hacking in Probabilistic Program Synthesis
Jacek Karwowski, Younesse Kaddar, Zihuiwen Ye +2
When language models are trained by reinforcement learning (RL) to write probabilistic programs, they can artificially inflate their marginal-likelihood reward by producing program…
An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories
Ohad Kammar, Jack Liell-Cock, Sam Lindley +2
We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concr…
A causal Markov category with Kolmogorov products
Sean Moss, Sam Staton
In Fritz & Rischel, Infinite products and zero-one laws in categorical probability, the problem was posed of finding an interesting Markov category which is causal and has all (sma…
The Relative Monadic Metalanguage
Jack Liell-Cock, Zev Shirazi, Sam Staton
Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Ad…
Deriving Program Logics from Distributive Monoidal Categories
Filippo Bonchi, Elena Di Lavore, Mario Román +1
We derive multiple program logics - including correctness, incorrectness, and relational Hoare logic - from the axioms of imperative categories: uniformly traced distributive copy-…
Uncertainty-Aware Step-wise Verification with Generative Reward Models
Zihuiwen Ye, Luckeciano Carvalho Melo, Younesse Kaddar +3
Complex multi-step reasoning tasks, such as solving mathematical problems, remain challenging for large language models (LLMs). While outcome supervision is commonly used, process…
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 with Exact Conditions
Dario Stein, Sam Staton
We spell out the paradigm of exact conditioning as an intuitive and powerful way of conditioning on observations in probabilistic programs. This is contrasted with likelihood-based…
Denotational semantics for languages for inference: semirings, monads, and tensors
Cristina Matache, Sean Moss, Sam Staton +1
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebrai…