Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring

DOI10.1007/978-3-662-54434-1_14zbMath1485.68029OpenAlexW2597297629MaRDI QIDQ2988648

Ryan Culpepper, Andrew Cobb

Publication date: 19 May 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-54434-1_14

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 (4)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ Commutative Semantics for Probabilistic Programming ⋮ Densities of almost surely terminating probabilistic programs are differentiable almost everywhere

Uses Software

• WinBUGS
• Infer.NET
• Church
• Stan
• Hakaru
• Venture
• GitHub
• Figaro

Cites Work

• Unnamed Item
• PCF extended with real numbers
• Integration in Real PCF
• Probabilistic Inference by Program Transformation in Hakaru (System Description)
• An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
• Environmental bisimulations for probabilistic higher-order languages
• Step-Indexed Logical Relations for Probability
• A lambda-calculus foundation for universal probabilistic programming
• Semantics for probabilistic programming
• Stochastic lambda calculus and monads of probability distributions
• Measure Transformer Semantics for Bayesian Machine Learning

This page was built for publication: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring