Abstract
This paper studies the denotational semantics of programming language constructs whose operational semantics require interleaving of computations. In particular a semantics is given for recursion equations with a convergence test. A convergence test is a nondeterministic construct which selects among expressions according to which one converges (i.e. takes on a value) first. This denotational semantics is shown to be equivalent to an operational semantics.
This paper uses the powerdomain construction to handle nondeterminism. The new idea is the treatment of parallelism. It is neccessary to add new elements to the domains in order to be able to distinguish between nonterminating computations and partial values. This distinction cannot be used in writing semantic equations. It is only used in interpreting the meaning of complete computations in which case partial values can be ignored.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
10. References
Chandra, A. [78] Computable nondeterministic functions, 19th Symp. on Foundations of Computer Science, Ann Arbor
Francez, N. & Hoare, C.A.R. & Lehmann, D & de Roever, W. P. [78] Semantics of nondeterminism, concurrency and communication
Friedman, D. & Wise, D. [78] A Note on conditional expressions, CACM 21, pp. 931–933
Hennessy, M. C. B. [77] The semantics of call-by-value and call-by-name in a nondeterministic environment, Computer Science Dept. Univ. of Waterloo CS-77-13
Hoare, C. A. R. [78] Communicating sequential processes, CACM 21, pp. 666–677
Manna, Zohar [74] Mathematical Theory of Computation, McGraw-Hill
Milner, Robin [78] Synthesis of communicating behavior, in Mathematical foundations of computer science 1978, Springer-Verlag Lecture Notes in Computer Science No. 64
Plotkin, G. [76] A powerdomain construction, SIAM Journal of Computing 5
Smyth, M. B. [78] Power domains, Jour. of Comp. and System Sciences 16, pp. 23–36
Stoy, J. [77] Denotational semantics of Programming Languages, MIT press
Tennent, R. D. [76] The denotational semantics of programming languages, CACM 19 pp. 437–453
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwarz, J.S. (1979). Denotational semantics of parallelism. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022470
Download citation
DOI: https://doi.org/10.1007/BFb0022470
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09511-8
Online ISBN: 978-3-540-35163-4
eBook Packages: Springer Book Archive