By Topic

A probabilistic powerdomain of evaluations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jones, C. ; Dept. of Comput. Sci., Edinburgh Univ., UK ; Plotkin, G.D.

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

Published in:

Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on

Date of Conference:

5-8 Jun 1989