Abstract
In this paper we conclude a two-part analysis of recent work of Jean Goubault-Larrecq and Daniele Varacca, who devised a model of continuous random variables over bounded complete domains. Their presentation leaves out many details, and also misses some motivations for their construction. In this and a related paper we attempt to fill in some of these details, and in the process, we discover a flaw in the model they built.
Our earlier paper showed how to construct \(\Theta\textsf{Prob} (A^\infty)\), the bounded complete algebraic domain of thin probability measures over A ∞ , the monoid of finite and infinite words over a finite alphabet A. In this second paper, we apply our earlier results to construct \(\Theta\textsl{RV}_{A^\infty}(D)\), the bounded complete domain of continuous random variables defined on supports of thin probability measures on A ∞ with values in a bounded complete domain D, and we show \(D\mapsto \Theta\textsl{RV}_{A^\infty}(D)\) is the object map of a monad. In the case A = {0,1}, our construction yields the domain of continuous random variables over bounded complete domains devised by Goubault-Larrecq and Varacca. However, we also show that the Kleisli extension \(h^\dag\colon {\Theta\textsl{RV}_{A^\infty}}(D)\to {\Theta\textsl{RV}}(E)\) of a Scott-continuous map h : D → E is not Scott continuous, so the construction does not yield a monad on BCD, the category of bounded complete domains and Scott-continuous maps. We leave the question of whether the construction can be rescued as an open problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: Domain theory in logical form. Annals of Pure and Applied Logic 51, 1–77 (1991)
Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, pp. 1–168. Clarendon Press (1994)
Beck, J.: Distributive laws, Seminar on Triples and Categorical Homology Theory. Lecture Notes in Mathematics, vol. 80, pp. 119–140 (1969)
Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31, 560–599 (1984)
Fedorchuk, V.: Probability measures in topology. Russ. Math. Surv. 46, 45–93 (1991)
Chaput, P., Danos, V., Panangaden, P., Plotkin, G.: Approximating Markov Processes by Averaging. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 127–138. Springer, Heidelberg (2009)
Gierz, G., Hofmann, K.H., Lawson, J.D., Mislove, M., Scott, D.: Continuous Lattices and Domains. Cambridge University Press (2003)
Gehrke, M., Grigorieff, S., Pin, J.-É.: Duality and equational theory of regular languages. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246–257. Springer, Heidelberg (2008)
Gehrke, M.: Stone duality and the recognisable languages over an algebra. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 236–250. Springer, Heidelberg (2009)
Goubault-Larrecq, J., Varacca, D.: Continuous random variables. In: LICS 2011, pp. 97–106. IEEE Press (2011)
Hofmann, K.H., Mislove, M.: Compact affine monoids, harmonic analysis and information theory. In: Mathematical Foundations of Information Flow, AMS Proceedings of Symposia on Applied Mathematics, vol. 71, pp. 125–182 (2012)
Hyland, M., Plotkin, G.D., Power, J.: Combining computational effects: commutativity and sum. In: IFIP TCS 2002, pp. 474–484 (2002)
Jones, C.: Probabilistic Nondeterminism. PhD Thesis, University of Edinburgh (1988)
Jung, A.: The classification of continuous domains (Extended Abstract). In: LICS 1990, pp. 35–40. IEEE Press (1990)
Jung, A., Tix, R.: The troublesome probabilistic powerdomain. ENTCS 13, 70–91 (1998)
Keimel, K., Plotkin, G.D., Tix, R.: Semantic domains for combining probability and non-Determinism. ENTCS 222, 2–99 (2009)
Mislove, M.: Nondeterminism and probabilistic choice: obeying the laws. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 350–374. Springer, Heidelberg (2000)
Mislove, M.: Discrete random variables over domains. Theoretical Computer Science 380, 181–198 (2007)
Mislove, M.: Topology domain theory and theoretical computer science. Topology and Its Applications 89, 3–59 (1998)
Mislove, M.: Anatomy of a domain of continuous random variables I. Submitted to TCS, 19 p.
Moggi, E.: Computational Lambda-calculus and monads. In: LICS 1989, pp. 14–23. IEEE Press (1989)
Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) Fossacs 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)
Saheb-Djarhomi, N.: CPOs of measures for nondeterminism. Theoretical Computer Science 12, 19–37 (1980)
Scott, D.S.: Data types as lattices. SIAM J. Comput. 5, 522–587 (1976)
Varacca, D.: Two Denotational Models for Probabilistic Computation. PhD Thesis, Aarhus University (2003)
Varacca, D., Winskel, G.: Distributing probability over nondeterminism. Mathematical Structures in Computer Science 16 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mislove, M. (2013). Anatomy of a Domain of Continuous Random Variables II. In: Coecke, B., Ong, L., Panangaden, P. (eds) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Lecture Notes in Computer Science, vol 7860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38164-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-38164-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38163-8
Online ISBN: 978-3-642-38164-5
eBook Packages: Computer ScienceComputer Science (R0)