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, et al.
יצא לאור: (2021) -
Probabilistic programming semantics for name generation
מאת: Sabok, M, et al.
יצא לאור: (2021) -
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
מאת: Yang, H, et al.
יצא לאור: (2016) -
Probabilistic programming with exact conditions
מאת: Stein, D, et al.
יצא לאור: (2024) -
Coalgebraic Semantics for Probabilistic Logic Programming
מאת: Tao Gu, et al.
יצא לאור: (2021-04-01)