Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture). We define a metalanguage (an idealised version of Anglican) for probabilistic computation w...
Autors principals: | Yang, H, Staton, S, Wood, F, Heunen, C, Kammar, O |
---|---|
Format: | Conference item |
Publicat: |
Association for Computing Machinery
2016
|
Ítems similars
-
A convenient category for higher-order probability theory
per: Heunen, C, et al.
Publicat: (2017) -
Commutative semantics for probabilistic programming
per: Staton, S
Publicat: (2017) -
A domain theory for statistical probabilistic programming
per: Vákár, M, et al.
Publicat: (2019) -
Compositional semantics for probabilistic programs with exact conditioning
per: Stein, D, et al.
Publicat: (2021) -
Probabilistic programming semantics for name generation
per: Sabok, M, et al.
Publicat: (2021)