Probabilistic programming language and its incremental evaluation
From MaRDI portal
Recommendations
- Probabilistic inference by program transformation in Hakaru (system description)
- The magic of logical inference in probabilistic programming
- A lambda-calculus foundation for universal probabilistic programming
- A provably correct sampler for probabilistic programs
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Cites work
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- A provably correct sampler for probabilistic programs
- Applicative programming with effects
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Probabilistic programming language and its incremental evaluation
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
Cited in
(8)- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Probabilistic programming language and its incremental evaluation
- A provably correct sampler for probabilistic programs
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Probabilistic inference by program transformation in Hakaru (system description)
- Hakaru10
- Automatic alignment in higher-order probabilistic programming languages
This page was built for publication: Probabilistic programming language and its incremental evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179303)