scientific article; zbMATH DE number 3890702
From MaRDI portal
Publication:3347262
[For the entire collection see Zbl 0533.00026.] We define a propositional programming language for probabilistic program schemes and study the equational properties of the programs thus arising.
Recommendations
- Linking theories of probabilistic programming
- Foundations of probabilistic programming
- Probabilistic Programs as Measures
- Understanding probabilistic programs
- Linking theories in probabilistic programming
- Reasoning about Recursive Probabilistic Programs
- Application ofComputable Distributions to the Semantics of Probabilistic Programs
- Probabilistic imperative programming: A rigorous approach (extended abstract)
- Reasoning about probabilistic sequential programs
Cited in
(14)- A probabilistic PDL
- Theory and practice of uncertain programming
- Linking theories in probabilistic programming
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Refinement algebra for probabilistic programs
- An assertion-based program logic for probabilistic programs
- Reasoning about probabilistic sequential programs
- Backwards abstract interpretation of probabilistic programs
- A lambda-calculus foundation for universal probabilistic programming
- Credibilistic programming. An introduction to models and applications
- Reasoning about Recursive Probabilistic Programs
- Statistical mechanics of program systems
- Probabilistic agent programs
- Decidability of finite probabilistic propositional dynamic logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347262)