Commutative semantics for probabilistic programming
We show that a measure-based denotational semantics for probabilistic programming is commutative. The idea underlying probabilistic programming languages (Anglican, Church, Hakaru, ...) is that programs express statistical models as a combination of prior distributions and likelihood of observations...
Auteur principal: | Staton, S |
---|---|
Format: | Conference item |
Publié: |
Springer, Berlin, Heidelberg
2017
|
Documents similaires
-
Compositional semantics for probabilistic programs with exact conditioning
par: Stein, D, et autres
Publié: (2021) -
Probabilistic programming semantics for name generation
par: Sabok, M, et autres
Publié: (2021) -
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
par: Yang, H, et autres
Publié: (2016) -
Probabilistic programming with exact conditions
par: Stein, D, et autres
Publié: (2024) -
Coalgebraic Semantics for Probabilistic Logic Programming
par: Tao Gu, et autres
Publié: (2021-04-01)