An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
Abstract elided by the publisher.
Related papers
- Safe couplings: coupled refinement types ICFP 2022
- Cantor meets scott: semantic foundations for probabilistic networks POPL 2017
- λPSI: exact inference for higher-order probabilistic programs PLDI 2020
- On probabilistic termination of functional programs with continuous distributions PLDI 2021
- Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops POPL 2025
- A probabilistic language based upon sampling functions POPL 2005
- Inference of Probabilistic Programs with Moment-Matching Gaussian Mixtures POPL 2024
- A model-learner pattern for bayesian reasoning POPL 2013