mlsanityData to 7 Oct 2026

Semantics of higher-order probabilistic programs with conditioning

arXiv 1902.11189 ↗First posted 28 Feb 2019cs.LO cs.LG cs.PLcited by 4

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

Cited by year

Citing papers per year: 2022: 2; 2023: 1; 2024: 1.

4 papers.