activity
20152025
most citedDenotational validation of higher-order Bayesian inference

64 citations · 159 across the 14 of their papers we have counts for

collaborators

14 papers

math.CT2025

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…

cs.CL2025

Theory-Grounded Evaluation of Human-Like Fallacy Patterns in LLM Reasoning

Andrew Keenan Richardson, Ryan Othniel Kearns, Sean Moss +2

We study logical reasoning in language models by asking whether their errors follow established human fallacy patterns. Using the Erotetic Theory of Reasoning (ETR) and its open-so…

cs.PL2024★ 2 cited

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…

cs.PL2023★ 3 cited

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…

cs.LO2023

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…

math.DS2022★ 12 cited

A category-theoretic proof of the ergodic decomposition theorem

Sean Moss, Paolo Perrone

The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergo…

cs.PL2022★ 3 cited

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…

cs.LO2022★ 6 cited

Probability monads with submonads of deterministic states - Extended version

Sean Moss, Paolo Perrone

Probability theory can be studied synthetically as the computational effect embodied by a commutative monad. In the recently proposed Markov categories, one works with an abstracti…

cs.PL2021★ 2 cited

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…

math.CT2021★ 12 cited

Dialectica models of type theory

Sean K. Moss, Tamara von Glehn

We present two Dialectica-like constructions for models of intensional Martin-Löf type theory based on Gödel's original Dialectica interpretation and the Diller-Nahm variant, bring…

astro-ph.EP2020★ 52 cited

Size and Shape Constraints of (486958) Arrokoth from Stellar Occultations

Marc W. Buie, Simon B. Porter, Peter Tamblyn +130

We present the results from four stellar occultations by (486958) Arrokoth, the flyby target of the New Horizons extended mission. Three of the four efforts led to positive detecti…

cs.PL2017★ 64 cited

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…

cs.PL2017

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…

math.CT2015★ 3 cited

Another approach to the Kan-Quillen model structure

Sean Moss

By careful analysis of the comparison map from a simplicial set to its image under Kan's ex-infinity functor we obtain a new and combinatorial proof that it is a weak homotopy equi…