Some probabilistic powerdomains in the category SFP

  • D. Frutos Escrig
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)

Abstract

We define and study some definitions of probabilistic powerdomains over domains in SFP. We give three definitions: the first one is based in the notion of probability distribution over a domain; the second in probabilistic generating trees, that generalize the notion of generating tree, introduced by Smyth; and the last in "informations about probability distributions", that we introduce, getting an information system, as defined by Scott.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C.V. BURRILL, "Measure, integration and probability". Mc.Graw Hill (1970).Google Scholar
  2. 2.
    D. FRUTOS ESCRIG, "A characterization of Plotkin's order in powerdomains and some of its properties" TCS 31 (1984).Google Scholar
  3. 3.
    D. FRUTOS ESCRIG, "Algunas cuestiones relacionadas con la semántica de construcciones probabilísticas" Tesis doctoral. Madrid, july 1985.Google Scholar
  4. 4.
    G. PLOTKIN, "A powerdomain construction" SIAM J. Comput. 5 (1976).Google Scholar
  5. 5.
    N. SAHEB-DJAHROMI, "CPO's of measures for nondeterminism" TCS 12 (1980).Google Scholar
  6. 6.
    D. SCOTT, "Domains for denotational semantics", ICALP-82 LNCS 140 Springer-Verlag, (1982).Google Scholar
  7. 7.
    M. SMYTH, "Powerdomains", J.C.S.S. 16 (1978).Google Scholar
  8. 8.
    M. SMYTH & G. PLOTKIN, "Category theoretic solution of recursive domain equations" SIAM J. Comput. 11,4 (1982).Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • D. Frutos Escrig
    • 1
  1. 1.Dpto. Ecuaciones Funcionales Fac. C. MatemáticasUniversidad ComplutenseMadridSpain

Personalised recommendations