Commutative Semantics for Probabilistic Programming

DOI10.1007/978-3-662-54434-1_32zbMath1485.68033OpenAlexW2595803793MaRDI QIDQ2988671

Sam Staton

Publication date: 19 May 2017

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:a01c37e1-9470-4dbf-b5a2-217dc58d6f93

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ Borel kernels and their approximation, categorically ⋮ The geometry of Bayesian programming ⋮ A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces ⋮ Graded Hoare logic and its categorical semantics ⋮ Correctness of sequential Monte Carlo inference for probabilistic programming languages ⋮ Densities of almost surely terminating probabilistic programs are differentiable almost everywhere ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ Unnamed Item ⋮ Disintegration and Bayesian inversion via string diagrams ⋮ Unnamed Item

Uses Software

• Church
• Stan
• Hakaru
• Venture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Freyd categories are enriched Lawvere theories
• Stationary and invariant densities and disintegration kernels
• Notions of computation and monads
• Generic models for computational effects
• Semantics of probabilistic programs
• Modelling environments in call-by-value programming languages.
• Generalising monads to arrows
• Representable multicategories
• A predicate/state transformer semantics for Bayesian learning
• A User's Guide to Measure Theoretic Probability
• Probabilistic Inference by Program Transformation in Hakaru (System Description)
• Running Probabilistic Programs Backwards
• Universal properties of impure programming languages
• A lambda-calculus foundation for universal probabilistic programming
• Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
• Categorical semantics for arrows
• Unique decomposition categories, Geometry of Interaction and combinatory logic
• Semantics for probabilistic programming
• Quantitative Algebraic Reasoning
• Synthetic topology in Homotopy Type Theory for probabilistic programming
• A Convenient Category for Higher-Order Probability Theory
• What is a Categorical Model of Arrows?
• Stochastic lambda calculus and monads of probability distributions
• Stochastic Relations
• Exact Bayesian inference by symbolic disintegration
• Lectures on the Poisson Process
• Linear usage of state
• Measure Transformer Semantics for Bayesian Machine Learning

This page was built for publication: Commutative Semantics for Probabilistic Programming