Abstract
Various closure properties of a domain theoretic construction for a probabilistic domain are considered. N. Saheb-Sjahromi's probabilistic domain construction is extended to non-algebraic domains, particularly RSFP objects. An abstract notion of a probabilistic domain is presented and the construction is shown to be free. Issues of computability and approaches to solving domain equations in probabilistic domains are addressed briefly.
This work was supported in part by NSF Grant DCR-8415919
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burstall, R.M., and Goguen, J.A., Algebras, Theories and Freeness: An Introduction for Computer Scientists, in Theoretical Foundations of Programming Methodology, ed. by Broy and Schmidt, D. Reidel, 1982, 329–348.
Gordon, M. J. C., The Denotational Description of Programming Languages, Springer-Verlag, New York, 1979.
Halmos, P.R., Measure Theory, Van Nostrand, New York, 1965.
Kamimura, T. and Tang, A. Finitely Continuous Posets, University of Kansas, Dept. of Computer Science, TR-84-1, 1984.
Kamimura, T. and Tang, A. Retracts of SFP objects, in Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 239, Springer-Verlag, 1985.
Kamimura, T. and Tang, A. Retracts of SFP objects-projective limits, solving domain equations, Workshop on Mathematical Foundations of Programming Semantics, Manhattan, Kansas, 1986.
Kamimura, T. and Tang, A., Domains as Finitely Continuous CPOs, (to be presented) 3rd Workshop on Mathematical Foundations of Programming Semantics, New Orleans, 1987.
Kozen, D. Semantics of probabilistic programs, Journal of Computer and System Sciences 22 (1981), 328–350.
Main, M. G., Free Constructions of Powerdomains, in Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 239, Springer-Verlag, 1985.
Plotkin, Gordon, A Powerdomain Construction, SIAM Journal of Computing, Vol. 5, No. 3, September 1976, 452–487.
Rabin, M. Probabilistic Algorithms, in Algorithms and Complexity, Academic Press, 1976, 21–40.
Royden, H.L., Real Analysis, MacMillan, New York, 1964.
Saheb-Djahromi, N. CPO's of measures for nondeterminism, Theoretical Computer Science, 12 (1980), 19–37.
Schmidt, D. A., Denotational Semantics, Allyn and Bacon, Inc., 1986.
Smyth, M.B., Effectively Giyen Domains, Theoretical Computer Science, 5 (1977), 257–274.
Tennent, R. D., The Denotational Semantics of Programming Languages, Communications of the ACM, Vol. 19, No. 8, Aug. 1976, 437–453.
Yemini, Y. and Kurose, J.F. Towards the unification of the functional and performance analysis of protocols or, is the alternating-bit protocol really correct?, in Protocol, Specification, Testing, and Verification, North-Holland, 1982, 189–196.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graham, S.K. (1988). Closure properties of a probabilistic domain construction. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-19020-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19020-2
Online ISBN: 978-3-540-38920-0
eBook Packages: Springer Book Archive