## Paper: A probabilistic powerdomain of evaluations (at LICS 1989)

Authors:**Jones, C. Plotkin, G.D.**

### Abstract

A probabilistic power domain construction is given for the category of inductively complete partial orders. It is the partial order of continuous [0,1]-valued evaluations on the Scott topology. By means of a theory of integration with respect to such evaluations, the powerdomain is shown to be a monad, and a model for the Moggi computational lambda calculus is obtained. It is also possible to solve recursive domain equations involving the powerdomain, and all this gives a metalanguage for programming languages with probabilistic features. This is used to give the semantics of a language with a probabilistic parallel construct. it is shown that the construction generalizes previous work on partial orders of measures

### BibTeX

@InProceedings{JonesPlotkin-Aprobabilisticpower, author = {Jones, C. and Plotkin, G.D.}, title = {A probabilistic powerdomain of evaluations}, booktitle = {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989}, year = 1989, editor = {Rohit Parikh}, month = {June}, pages = {186--195}, location = {Pacific Grove, CA, USA}, publisher = {IEEE Computer Society Press} }