Sam Staton
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
all 4 in the filters
on a stage with
all 26 in the filters
who talks about the same things
- Mathieu Huot11 talks
- Jack Liell-Cock4 talks
- Hongseok Yang9 talks
- Younesse Kaddar4 talks
- Vikash K. Mansinghka24 talks
- Alexander K. Lew21 talks
| title | conference | date |
|---|---|---|
| An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on(…) | POPL 2026 | 2026-01-11 |
Paper gives a concrete equational axiomatization for dynamic threads: a parameterized algebraic theory (using presheaves and strong monads) that encodes… | ||
| The Relative Monadic Metalanguage | POPL 2026 | 2026-01-11 |
Generalises the monadic metalanguage to a relative setting and gives a complete semantics using a new definition of strong relative monads. Builds a… | ||
| Algebraic and denotational semantics for Classically Controlled Quantum Communication | PLanQC 2025 | 2025-01-25 |
Claims a parameterised algebraic theory for classically controlled quantum I/O and gives two sound models: a quantum stream operational semantics (streams as… | ||
| Data-oriented Design for Differentiable, Probabilistic Programming | LAFI 2025 | 2025-01-19 |
Reimplementation of the lazy rose tree from LazyPPL into a strict, data-oriented Rust backend reduces thunk size from about 16 to 4 bytes, stores nodes and… | ||
| NP-NUTS: A Nonparametric No-U-Turn Sampler | LAFI 2025 | 2025-01-19 |
A new algorithm, NP‑NUTS, automatically adapts HMC trajectory length for models whose parameter dimension varies by combining NUTS’s doubling/tree construction… | ||
| Compositional imprecise probability: a solution from graded monads and Markov categories | POPL 2025 | 2025-01-19 |
Provides a fully compositional semantic for imprecise probability by naming nondeterministic choices and tracking them with graded monads, giving a… | ||
| A slice sampler for the Indian Buffet Process: expressivity in nonparametric pro... | LAFI 2024 | 2024-01-14 |
Introduces a slice-sampling construction that encodes the Indian Buffet Process inside a pure probabilistic program without truncation or hidden state, by… | ||
| Probabilistic programming interfaces for random graphs: Markov categories, graph... | POPL 2024 | 2024-01-14 |
Proves an equivalence: a well-behaved implementation of an abstract graph type (vertices, new, edge) corresponds exactly to a graphon. Uses Markov categories… | ||
| What do posterior distributions of probabilistic programs look like? | LAFI 2023 | 2023-01-15 |
Defines s-Hausdorff measures and proves any probabilistic program with piecewise analytic primitives denotes a measure that has a density w.r.t. some… | ||
| Denotational semantics of languages for inference: semirings, monads, and tensor... | LAFI 2023 | 2023-01-15 |
Claims an explicit algebraic route: modules over a semiring R yield monads T_R sending X to finitely supported unnormalized measures R^X and submonads fixing… | ||
| Affine Monads and Lazy Structures for Bayesian Programming | POPL 2023 | 2023-01-15 |
Argues that infinite-dimensional Bayesian models (Poisson, Gaussian, Dirichlet, Beta, jump processes) are naturally expressed with lazy streams and infinite… | ||
| ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Progra... | POPL 2023 | 2023-01-15 |
ADEV is a source-to-source extension of forward-mode AD that transforms a probabilistic program into another whose expected return equals the derivative of the… | ||
| Higher order programming with probabilistic effects: A model of stochastic memo... | HOPE 2022 | 2022-09-11 |
Claims a concrete categorical model that makes stochastic memoization respect the crucial dataflow property while keeping higher-order functions by building a… | ||
| Abstract types in probabilistic programming | LAFI 2022 | 2022-01-16 |
Library called lazy people implements higher-order probabilistic types and runs Metropolis–Hastings to do regression: a rand_linear prior draws slope and… | ||
| Probabilistic Programming Semantics for Name Generation | POPL 2021 | 2021-01-17 |
Claims a concrete semantics: quasi-Borel spaces interpret the ν-calculus by mapping name generation to Gaussian sampling, and the model is fully abstract at… | ||
| nothing matches | ||