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...
Главный автор: | Staton, S |
---|---|
Формат: | Conference item |
Опубликовано: |
Springer, Berlin, Heidelberg
2017
|
Схожие документы
-
Compositional semantics for probabilistic programs with exact conditioning
по: Stein, D, и др.
Опубликовано: (2021) -
Probabilistic programming semantics for name generation
по: Sabok, M, и др.
Опубликовано: (2021) -
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
по: Yang, H, и др.
Опубликовано: (2016) -
Probabilistic programming with exact conditions
по: Stein, D, и др.
Опубликовано: (2024) -
Coalgebraic Semantics for Probabilistic Logic Programming
по: Tao Gu, и др.
Опубликовано: (2021-04-01)