The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces [chapter]

Ben Cohen, Martin Escardo, Klaus Keimel
2006 Lecture Notes in Computer Science  
For the semantics of probabilistic features in programming mainly two approaches are used for building models. One is the Giry monad of Borel probability measures over metric spaces, and the other is Jones' probabilistic powerdomain monad [6] over dcpos (directed complete partial orders). This paper places itself in the second domain theoretical tradition. The probabilistic powerdomain monad is well understood over continuous domains. In this case the algebras of the monad can be described by
more » ... equational theory [6, 9, 5] . It is the aim of this work to obtain similar results for the (extended) probabilistic powerdomain monad over stably compact spaces. We mainly want to determine the algebras of this powerdomain monad and the algebra homomorphisms.
doi:10.1007/11750321_54 fatcat:s3gjcsnqifgddic3g2e4d2kwsa