Measurable Cones and Stable, Measurable Functions
Logic in Computer Science
2017-11-28 v1 Programming Languages
Abstract
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the main primitives of probabilistic functional programming, like continuous and discrete probabilistic distributions, sampling, conditioning and full recursion. We prove the soundness and adequacy of this model with respect to a call-by-name operational semantics and give some examples of its denotations.
Cite
@article{arxiv.1711.09640,
title = {Measurable Cones and Stable, Measurable Functions},
author = {Thomas Ehrhard and Michele Pagani and Christine Tasson},
journal= {arXiv preprint arXiv:1711.09640},
year = {2017}
}