A probabilistic powerdomain of evaluations
Jones, C.
Plotkin, G.D.
Dept. of Comput. Sci., Edinburgh Univ.;
This paper appears in: Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Publication Date: 5-8 Jun 1989
On page(s): 186-195
Meeting Date: 06/05/1989 - 06/08/1989
Location: Pacific Grove, CA, USA
ISBN: 0-8186-1954-6
References Cited: 17
INSPEC Accession Number: 3496549
Digital Object Identifier: 10.1109/LICS.1989.39173
Current Version Published: 2002-08-06
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
