A Formal Foundation for Equational Reasoning on Probabilistic Programs
No abstract available.
DOI 10.1007/978-981-95-3585-9_3
Related papers
- A trustful monad for axiomatic reasoning with probability and nondeterminism JFP 2021
- Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning OOPSLA 2023
- Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization POPL 2019
- Denotational Foundations for Expected Cost Analysis OOPSLA 2025
- Formal metatheory of second-order abstract syntax POPL 2022
- Asynchronous Probabilistic Couplings in Higher-Order Separation Logic POPL 2024
- Cantor meets scott: semantic foundations for probabilistic networks POPL 2017
- On the Operational Theory of the CPS-Calculus: Towards a Theoretical Foundation for IRs ICFP 2024