Continuous previsions

Authors:
Jean Goubault-Larrecq
Affiliations:
LSV, ENS Cachan, CNRS, INRIA Futurs, Cachan, France
Venue:
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Year:
2007

Citing 11
Cited 4

Notions of computation and monads

Information and Computation
Probabilistic non-determinism

Probabilistic non-determinism
Domain theory

Handbook of logic in computer science (vol. 3)
Stochastic lambda calculus and monads of probability distributions

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Powerdomain of Indexed Valuations

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Nondeterminism and Probabilistic Choice: Obeying the Laws

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Distributing probability over non-determinism

Mathematical Structures in Computer Science
A domain-theoretic Banach–Alaoglu theorem

Mathematical Structures in Computer Science
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism

Electronic Notes in Theoretical Computer Science (ENTCS)
Stably Compact Spaces and the Probabilistic Powerspace construction

Electronic Notes in Theoretical Computer Science (ENTCS)
Continuous capacities on continuous state spaces

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Simulation hemi-metrics between infinite-state stochastic games

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Prevision domains and convex powercones

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
De groot duality and models of choice: Angels, demons and nature†

Mathematical Structures in Computer Science
Approximating Markov Processes by Averaging

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.