Two Probabilistic Powerdomains in Topological Domain Theory

We present two probabilistic powerdomain constructions in topological domain theory. The first is given by a free ”convex space” construction, fitting into the theory of modelling computational effects via free algebras for equational theories, as proposed by Plotkin and Power. The second is given by an observationally induced approach, following Schroder and Simpson. We show the two constructions coincide when restricted to ω-continuous dcppos, in which case they yield the space of (continuous) probability valuations equipped with the Scott topology. Thus either construction generalises the classical domain-theoretic probabilistic powerdomain. On more general spaces, the constructions differ, and the second seems preferable. Indeed, for countably-based spaces, we characterise the observationally induced powerdomain as the space of probability valuations with weak topology. However, we show that such a characterisation does not extend to non countablybased spaces.

[1]  Klaus Keimel,et al.  The probabilistic powerdomain for stably compact spaces , 2004, Theor. Comput. Sci..

[2]  J. Hyland.  First steps in synthetic domain theory , 1991 .

[3]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[4]  Thomas Streicher,et al.  A Category of Topological Predomains , 2008 .

[5]  Matthias Schröder,et al.  Two preservation results for countable products of sequential spaces , 2007, Mathematical Structures in Computer Science.

[6]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[7]  Klaus Keimel,et al.  The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces , 2006, TAMC.

[8]  Thomas Streicher,et al.  Quotients of countably based spaces are not closed under sobrification , 2006, Math. Struct. Comput. Sci..

[9]  Matthias Schröder,et al.  Extended admissibility , 2002, Theor. Comput. Sci..

[10]  A. Simpson,et al.  Towards a Convenient Category of Topological Domains , 2003 .

[11]  E. R. Emmet,et al.  Handbook of logic , 1966 .

[12]  Achim Jung,et al.  The troublesome probabilistic powerdomain , 1997, COMPROX.

[13]  Matías Menni,et al.  Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces , 2002, Math. Struct. Comput. Sci..

[14]  J. Hyland,et al.  The Discrete Objects in the Effective Topos , 1990 .

[15]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[16]  Ingo Battenfeld,et al.  Computational Effects in Topological Domain Theory , 2006, MFPS.

[17]  Matthias Schröder,et al.  Compactly generated domain theory , 2006, Mathematical Structures in Computer Science.

[18]  C. Jones,et al.  A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[19]  Reinhold Heckmann,et al.  Probabilistic Domains , 1994, CAAP.

[20]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[21]  J. Lawson,et al.  Comparing Cartesian closed categories of (core) compactly generated spaces , 2004 .

[22]  Matthias Schröder,et al.  Probabilistic Observations and Valuations: (Extended Abstract) , 2005, MFPS.

[23]  Diplom-Informatiker Matthias Schroder,et al.  Admissible representations for continuous computations , 2002 .

[24]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[25]  Gordon D. Plotkin,et al.  Computational Effects and Operations: An Overview , 2004, Electron. Notes Theor. Comput. Sci..

[26]  Reinhold Heckmann,et al.  Spaces of Valuations , 1996 .

[27]  Matthias Schröder,et al.  A Convenient Category of Domains , 2007, Computation, Meaning, and Logic.

[28]  Steven K. Graham,et al.  Closure Properties of a Probabilistic Domain Construction , 1987, MFPS.