A lambda-calculus foundation for universal probabilistic programming

  title={A lambda-calculus foundation for universal probabilistic programming},
  author={J. Borgstr{\"o}m and Ugo Dal Lago and A. D. Gordon and M. Szymczak},
  journal={Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming},
We develop the operational semantics of an untyped probabilistic λ-calculus with continuous distributions, and both hard and soft constraints,as a foundation for universal probabilistic programming languages such as Church, Anglican, and Venture. Our first contribution is to adapt the classic operational semantics of λ-calculus to a continuous setting via creating a measure space on terms and defining step-indexed approximations. We prove equivalence of big-step and small-step formulations of… Expand
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
A domain theory for statistical probabilistic programming
A Denotational Semantics for Nondeterminism in Probabilistic Programs
Confluence in Probabilistic Rewriting
Denotational validation of higher-order Bayesian inference
Contextual equivalence for a probabilistic language with continuous random variables and recursion
Probabilistic concurrent game semantics
Commutative Semantics for Probabilistic Programming
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism


Church: a language for generative models
Step-Indexed Logical Relations for Probability
The principles and practice of probabilistic programming
An Introduction To Measure Theory
A lambda-calculus foundation for universal probabilistic programming
Probabilistic models of cognition
  • http://probmods.org,
  • 2014
Implementing a correct sampler for imperative probabilistic programs
  • In Proc. FSTTCS ’15: Foundations of Software Technology and Theoretical Computer Science,
  • 2015
An Introduction to Measure
  • Theory. AMS,
  • 2011