Semantics of higher-order probabilistic programs with conditioning
Not on the map. Why?
Abstract (arXiv)
We present a denotational semantics for higher-order probabilistic programs in terms of linear operators between Banach spaces. Our semantics is rooted in the classical theory of Banach spaces and their tensor products, but bears similarities with the well-known Scott semantics of higher-order programs through the use ordered Banach spaces which allow definitions in terms of fixed points. Being based on a monoidal rather than cartesian closed structure, our semantics effectively treats randomness as a resource.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2022Checking Trustworthiness of Probabilistic Computations in a Typed Natural Deduction Systemcited by 3
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothingcited by 2
- 2022Mixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminismcited by 0
- 2024Data Petri Nets meet Probabilistic Programming (Extended version)cited by 0
- 2024Data Petri Nets meet Probabilistic Programming (Extended version)12 Jun 2024
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing9 Jan 2023
- 2022Checking Trustworthiness of Probabilistic Computations in a Typed Natural Deduction System26 Jun 2022
- 2022Mixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminism19 Jan 2022