Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
DOI10.1007/978-3-662-54434-1_14zbMATH Open1485.68029OpenAlexW2597297629MaRDI QIDQ2988648FDOQ2988648
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
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)
Cites Work
- PCF extended with real numbers
- Analysis.
- Stochastic lambda calculus and monads of probability distributions
- Integration in Real PCF
- Semantics for probabilistic programming
- Measure transformer semantics for Bayesian machine learning
- Step-Indexed Logical Relations for Probability
- An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
- Environmental bisimulations for probabilistic higher-order languages
- A lambda-calculus foundation for universal probabilistic programming
- Probabilistic Inference by Program Transformation in Hakaru (System Description)
Cited In (5)
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Modelling contextuality by probabilistic programs with hypergraph semantics
- On bisimilarity in lambda calculi with continuous probabilistic choice
- Commutative Semantics for Probabilistic Programming
- Program equivalence in an untyped, call-by-value functional language with uncurried functions
Uses Software
This page was built for publication: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988648)
