Continuous Previsions

We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent proposals by Mislove, Tix, Keimel, and Plotkin. We show that our monads are sound and complete, in the sense that they model exactly the interaction between probabilistic and (demonic, angelic, chaotic) choice.

[1]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[2]  Walter Roth,et al.  Hahn-Banach Type Theorems for Locally Convex Cones , 2000, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[3]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electron. Notes Theor. Comput. Sci..

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

[5]  Michael W. Mislove.  Nondeterminism and Probabilistic Choice: Obeying the Laws , 2000, CONCUR.

[6]  Regina Tix,et al.  Continuous D-cones: convexity and powerdomain constructions , 1999 .

[7]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

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

[9]  Itzhak Gilboa,et al.  Additive representations of non-additive measures and the choquet integral , 1994, Ann. Oper. Res..

[10]  M. Smyth.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[11]  Sebastian Maaß.  Coherent Lower Previsions as Exact Functionals and their (Sigma-)Core , 2001, ISIPTA.

[12]  Tarmo Uustalu,et al.  Coproducts of Ideal Monads , 2004, RAIRO Theor. Informatics Appl..

[13]  Sebastian Maaß.  Continuous Linear Representation of Coherent Lower Previsions , 2003, ISIPTA.

[14]  Daniele Varacca,et al.  The powerdomain of indexed valuations , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[15]  Thomas Lukasiewicz,et al.  Reasoning with imprecise probabilities , 2000, Int. J. Approx. Reason..

[16]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[17]  Norman Ramsey,et al.  Stochastic lambda calculus and monads of probability distributions , 2002, POPL '02.

[18]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[19]  Christoph Lüth.  Categorical term rewriting : monads and modularity , 1998 .

[20]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[21]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[22]  Martín Hötzel Escardó,et al.  Topologies on spaces of continuous functions , 2001 .

[23]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[24]  G. L Y N N W I N S K E L.  Distributing probability over nondeterminism , 2005 .

[25]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[26]  Achim Jung,et al.  Stably Compact Spaces and the Probabilistic Powerspace construction , 2004, DTMPP.

[27]  Gordon D. Plotkin.  A domain-theoretic Banach–Alaoglu theorem , 2006, Mathematical Structures in Computer Science.

[28]  Michael W. Mislove,et al.  Topology, domain theory and theoretical computer science , 1998 .

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

[30]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.

[31]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[32]  Jean Goubault-Larrecq,et al.  Continuous Capacities on Continuous State Spaces , 2007, ICALP.

[33]  P. Walley.  Statistical Reasoning with Imprecise Probabilities , 1990 .