Commutative Monads for Probabilistic Programming Languages

DOI10.1109/LICS52264.2021.9470611arXiv2102.00510MaRDI QIDQ6359486FDOQ6359486

Authors: Xiaodong Jia, Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev 

Publication date: 31 January 2021

Abstract: A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the category DCPO. In this paper we present three such monads and a general construction for finding even more. We show how to use these monads to provide a sound and adequate denotational semantics for the Probabilistic FixPoint Calculus (PFPC) -- a call-by-value simply-typed lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. We also show that in the special case where we consider continuous dcpo's, then all three monads coincide with the valuations monad of Jones and we fully characterise the induced Eilenberg-Moore categories by showing that they are all isomorphic to the category of continuous Kegelspitzen of Keimel and Plotkin.

This page was built for publication: Commutative Monads for Probabilistic Programming Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359486)