Boolean-valued semantics for the stochastic λ-calculus

Tools

Bacci, Giorgio and Furber, Robert and Kozen, Dexter and Mardare, Radu and Panangaden, Prakash and Scott, Dana; (2018) Boolean-valued semantics for the stochastic λ-calculus. In: LICS '18 : Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, GBR, pp. 669-678. ISBN 9781450355834 (https://doi.org/10.1145/3209108.3209175)

[thumbnail of Bacci-etal-LICS-2018-Boolean-valued-semantics-for-the-stochastic-lamda-calculus]
Preview
 Text. Filename: Bacci_etal_LICS_2018_Boolean_valued_semantics_for_the_stochastic_lamda_calculus.pdf
Accepted Author Manuscript
Download (785kB)| Preview

Abstract

The ordinary untyped -calculus has a -theoretic model proposed in two related forms by Scott and Plotkin in the 1970s. Recently Scott showed how to introduce probability by extending these models with random variables. However, to reason about correctness and to add further features, it is useful to reinterpret the construction in a higher-order Boolean-valued model involving a measure algebra. We develop the semantics of an extended stochastic -calculus suitable for modeling a simple higher-order probabilistic programming language. We exhibit a number of key equations satisfied by the terms of our language. The terms are interpreted using a continuation-style semantics with an additional argument, an infinite sequence of coin tosses, which serves as a source of randomness. We also introduce a fixpoint operator as a new syntactic construct, as Β-reduction turns out not to be sound for unrestricted terms. Finally, we develop a new notion of equality between terms interpreted in a measure algebra, allowing one to reason about terms that may not be equal almost everywhere. This provides a new framework and reasoning principles for probabilistic programs and their higher-order properties.

CORE (COnnecting REpositories)