A Convenient Fibration for Dependently-Typed Probability Theory
Danel Ahman, Ohad Kammar, Rasmus Ejlers Møgelberg
Abstract
We describe semantic structures relevant for interpreting dependent types for statistical and probabilistic modelling. Our development extends the theory of quasi-Borel spaces (qbses) of Staton et. al, which support simply-typed, higher-order probability theory with continuous distributions. It is well-known that qbses can interpret a dependent-type theory supporting dependent function-spaces through the codomain fibration. We define an equivalent split fibration based on the family fibration, which we call quasi-Borel families (qbfs), characterise its structure, equip it with fibred monads of measures and probability, and use them to develop dependently-typed probability theory.
We characterise the structure of the qbf fibration that is relevant for dependently-typed probability theory in elementary form. Our characterisations include: context extension, dependent pairs, dependent functions, extensional identity types, fibred products and coproducts, subspaces, a universe of propositions, and straightforward internalisation and externalisation principles for discrete spaces. We use these concepts to define fibred distribution and probability monads, the semantic structure needed to interpret probability distributions under a dependent context. We show that this structure satisfies a fibred version of Kock's synthetic measure theory. We also use these concepts to develop a qbs counterpart to Kolmogorov's conditional expectation. Our main result is a version of the conditional expectation that, under standard regularity assumptions, is measurable in both the random variables we are conditioning, and the observation map we are conditioning by.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b6b2bc66-1048-4400-a9cd-1e6508e965b2Builds on8
- Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoningKevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph MathejaPOPL 2021 · 33 citations
- A Calculus for Amortized Expected RuntimesKevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja et al.POPL 2023 · 22 citations
- Affine Monads and Lazy Structures for Bayesian ProgrammingSwaraj Dash, Younesse Kaddar, Hugo Paquet, Sam StatonPOPL 2023 · 12 citations
- A Nominal Approach to Probabilistic Separation LogicJohn M. Li, Jon Aytac, Philip Johnson-Freyd, Amal Ahmed et al.LICS 2024 · 8 citations
- Equivalence and Conditional Independence in Atomic Sheaf LogicAlex SimpsonLICS 2024 · 4 citations
Related papers
- Random Variables, Conditional Independence and Categories of Abstract Sample SpacesDario SteinLICS 2025 · 2 citations
- A Bunched Logic for Conditional IndependenceJialu Bao, Simon Docherty, Justin Hsu, Alexandra SilvaLICS 2021 · 15 citations
- Linear Dependent Type Theory for Quantum Programming Languages: Extended AbstractPeng Fu, Kohei Kishida, Peter SelingerLICS 2020 · 23 citations
- Fully abstract models for effectful λ-calculi via category-theoretic logical relationsOhad Kammar, Shin-ya Katsumata, Philip SavillePOPL 2022 · 3 citations
- Interpreting De Finetti's Theorem in the Category of Integrable ConesRaphaëlle CrubilléLICS 2026
