The geometry of Bayesian programming
From MaRDI portal
Publication:5076392
Abstract: We give a geometry of interaction model for a typed lambda-calculus endowed with operators for sampling from a continuous uniform distribution and soft conditioning, namely a paradigmatic calculus for higher-order Bayesian programming. The model is based on the category of measurable spaces and partial measurable functions, and is proved adequate with respect to both a distribution-based and a sampling based operational semantics.
Recommendations
- A lambda-calculus foundation for universal probabilistic programming
- A Convenient Category for Higher-Order Probability Theory
- Measure transformer semantics for Bayesian machine learning
- Measure transformer semantics for Bayesian machine learning
- Bayesian strategies: probabilistic programs as generalised graphical models
Cites work
- A Convenient Category for Higher-Order Probability Theory
- A lambda-calculus foundation for universal probabilistic programming
- A survey of graphical languages for monoidal categories
- Causal inference by string diagram surgery
- Commutative semantics for probabilistic programming
- Equation of state calculations by fast computing machines
- Full abstraction for PCF
- Full abstraction for probabilistic PCF
- Fully abstract models of the probabilistic -calculus
- Geometry of Interaction and linear combinatory algebras
- Glueing and orthogonality for models of linear logic
- scientific article; zbMATH DE number 1722659 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 4123722 (Why is no real title available?)
- scientific article; zbMATH DE number 1231510 (Why is no real title available?)
- scientific article; zbMATH DE number 1231645 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- Linear logic
- Memoryful geometry of interaction. II: Recursion and adequacy
- Memoryful geometry of interaction: from coalgebraic components to algebraic effects
- Monte Carlo sampling methods using Markov chains and their applications
- Notions of computation and monads
- On coinductive equivalences for higher-order probabilistic functional programs
- On full abstraction for PCF: I, II and III
- On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
- PRIMES is in P
- Probabilistic algorithm for testing primality
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Probabilistic game semantics
- Probabilistic termination by monadic affine sized typing
- Riemann's hypothesis and tests for primality
- The concurrent game semantics of probabilistic PCF
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Traced monoidal categories
Cited in
(7)- Bayesian strategies: probabilistic programs as generalised graphical models
- scientific article; zbMATH DE number 4215140 (Why is no real title available?)
- Basic Concepts of Bayesian Programming
- BCAD: A Bayesian CAD System for Geometric Problems Specification and Resolution
- The beta-Bernoulli process and algebraic effects
- The geometry of Bayesian programming
- A domain-theoretic approach to statistical programming languages
This page was built for publication: The geometry of Bayesian programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076392)
