Universal Semantics for the Stochastic Lambda-Calculus
Logic in Computer Science
2021-05-18 v2
Abstract
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).
Cite
@article{arxiv.2011.13171,
title = {Universal Semantics for the Stochastic Lambda-Calculus},
author = {Pedro Amorim and Dexter Kozen and Radu Mardare and Prakash Panangaden and Michael Roberts},
journal= {arXiv preprint arXiv:2011.13171},
year = {2021}
}
Comments
14 pages