Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming

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...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 2; no. POPL; pp. 1 - 28
Main Authors:	Ehrhard, Thomas, Pagani, Michele, Tasson, Christine
Format:	Journal Article
Language:	English
Published:	01.01.2018
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!