Paper Info
Title
Commutative Monads for Probabilistic Programming Languages
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) –...
Year
DOI
Venue
2021
10.1109/LICS52264.2021.9470611
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Keywords
DocType
ISBN
Computer science,Computer languages,Semantics,Probabilistic logic,Calculus,Cost accounting
Conference
978-1-6654-4895-6
Citations 
PageRank 
References 
0
0.34
0
Authors
4
Name
Order
Citations
PageRank
Xiaodong Jia100.34
Bert Lindenhovius200.34
Michael Mislove3968.78
Vladimir Zamdzhiev4283.35