Semantics of probabilistic programs
Author:
- Dexter KozenDKDexter Kozen
- 1 October 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 101-114
Abstract
Two complementary but equivalent semantic interpretations of a high level probabilistic programming language are given. One of these interprets programs as partial measurable functions on a measurable space. The other interprets programs as continuous linear operators on a Banach space of measures. It is shown how the ordered domains of Scott and others are embedded naturally into these spaces. Two general results about probabilistic programs are proved.Keywords
This publication has 16 references indexed in Scilit:
- BASICACM SIGPLAN Notices, 1978
- Probabilistic computations: Toward a unified measure of complexity1977
- Expected time bounds for selectionCommunications of the ACM, 1975
- Theory of Program Structures: Schemes, Semantics, Verification1975
- Computational complexity of probabilistic Turing machines1974
- Formal models for some features of programming languages1969
- The FORTRAN automatic coding system1957
- Measure Theory1950
- Concrete Representation of Abstract (L)-Spaces and the Mean Ergodic TheoremAnnals of Mathematics, 1941
- Dependent Probabilities and Spaces (L)Proceedings of the National Academy of Sciences, 1938