Algebraic posets, algebraic cpo's and models of concurrency
Topology and category theory in computer science
Probabilistic non-determinism
Variations on the bagdomain theme
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics. Part II : lambda calculus and domain theory: lambda calculus and domain theory
Handbook of logic in computer science (vol. 3)
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
Mathematical Structures in Computer Science
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Discrete random variables over domains
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we explore discrete random variables over domains. We show that these lead to a continuous endofunctor on the categories RB (domains that are retracts of bifinite domains), and FS (domains where the identity map is the directed supremum of deflations finitely separated from the identity). The significance of this result lies in the fact that there is no known category of continuous domains that is closed under the probabilistic power domain, which forms the standard approach to modeling probabilistic choice over domains. The fact that RB and FS are cartesian closed and also are closed under the discrete random variables power domain means we can now model, e.g., the untyped lambda calculus extended with a probabilistic choice operator, implemented via random variables.