This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
De Bakker, J.W., Least Fixed Points Revisited, Lecture Notes in Computer Science, Springer Verlag, Vol. 37, 1975.
Feller, W., An Introduction to Probability Theory and its Applications, Vol. 1, Wiley International Edition.
Hennessy, M., and Ashcroft, E., Parameter-Passing Mechanisms and Non-determinism, Ninth Annual ACM Symposium on Theory of Computation, Vol. 1, 1977.
Milner, R., Models of LCF, Stanford Artificial Intelligence Laboratory, Memo. AIM — 186, 1973.
Milner, R., Program Semantics and Mechanized Proof, Math. Centre Tracts, Amsterdam, 1976.
Plotkin, G., LCF Considered as a Programming Language, Symposium on Proving and Improving Programs, Arc et Senans, 1975.
Saheb-Djahromi, N., Probabilistic Non-Determinism, Internal Report, University of Edinburgh, Sept. 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saheb-Djahromi, N. (1978). Probabilistic LCF. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_92
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08921-6
Online ISBN: 978-3-540-35757-5
eBook Packages: Springer Book Archive