  We define sound and adequate denotational and operational semantics for the
stochastic lambda calculus. These two semantic approaches build on previous
work that used similar techniques to reason about higher-order probabilistic
programs, but for the first time admit an adequacy theorem relating the
operational and denotational views. This resolves the main issue left open in
(Bacci et al. 2018).
