Commutative semantics for probabilistic programming
From MaRDI portal
Recommendations
- An application of computable distributions to the semantics of probabilistic programming languages
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Conditioning in probabilistic programming
- Running probabilistic programs backwards
- Measure transformer semantics for Bayesian machine learning
Cites work
- scientific article; zbMATH DE number 2134022 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 193631 (Why is no real title available?)
- scientific article; zbMATH DE number 1350306 (Why is no real title available?)
- scientific article; zbMATH DE number 3316072 (Why is no real title available?)
- A Convenient Category for Higher-Order Probability Theory
- A lambda-calculus foundation for universal probabilistic programming
- A predicate/state transformer semantics for Bayesian learning
- A user's guide to measure theoretic probability
- Categorical semantics for arrows
- Contextual equivalence for probabilistic programs with continuous random variables and scoring
- Exact Bayesian inference by symbolic disintegration
- Freyd categories are enriched Lawvere theories
- Generalising monads to arrows
- Generic models for computational effects
- Lectures on the Poisson Process
- Linear usage of state
- Measure transformer semantics for Bayesian machine learning
- Modelling environments in call-by-value programming languages.
- Notions of computation and monads
- Probabilistic inference by program transformation in Hakaru (system description)
- Quantitative Algebraic Reasoning
- Representable multicategories
- Running probabilistic programs backwards
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Semantics of probabilistic programs
- Stationary and invariant densities and disintegration kernels
- Stochastic Relations
- Stochastic lambda calculus and monads of probability distributions
- Synthetic topology in Homotopy Type Theory for probabilistic programming
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- Universal properties of impure programming languages
- What is a categorical model of arrows?
Cited in
(29)- Running probabilistic programs backwards
- String diagrams with factorized densities
- Effectful semantics in 2-dimensional categories: premonoidal and Freyd bicategories
- Bayesian strategies: probabilistic programs as generalised graphical models
- A fibrational tale of operational logical relations: pure, effectful and differential
- Element-free probability distributions and random partitions
- A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Graded Hoare logic and its categorical semantics
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- An application of computable distributions to the semantics of probabilistic programming languages
- On bisimilarity in lambda calculi with continuous probabilistic choice
- Borel kernels and their approximation, categorically
- Premonoidal and Kleisli double categories
- Probabilistic inference by program transformation in Hakaru (system description)
- A domain-theoretic approach to statistical programming languages
- Probabilistic programming with exact conditions
- A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories
- On iteration in discrete probabilistic programming
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- The geometry of Bayesian programming
- A categorical treatment of open linear systems
- Fast and correct gradient-based optimisation for probabilistic programming via smoothing
- Conditioning in probabilistic programming
- Distribution bisimilarity via the power of convex algebras
- Symbolic semantics for probabilistic programs
- Disintegration and Bayesian inversion via string diagrams
This page was built for publication: Commutative semantics for probabilistic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988671)
