Denotational semantics of parallelism

  • Jerald S. Schwarz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 70)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

10. References

  1. Chandra, A. [78] Computable nondeterministic functions, 19th Symp. on Foundations of Computer Science, Ann ArborGoogle Scholar
  2. Francez, N. & Hoare, C.A.R. & Lehmann, D & de Roever, W. P. [78] Semantics of nondeterminism, concurrency and communicationGoogle Scholar
  3. Friedman, D. & Wise, D. [78] A Note on conditional expressions, CACM 21, pp. 931–933Google Scholar
  4. 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-13Google Scholar
  5. Hoare, C. A. R. [78] Communicating sequential processes, CACM 21, pp. 666–677Google Scholar
  6. Manna, Zohar [74] Mathematical Theory of Computation, McGraw-HillGoogle Scholar
  7. Milner, Robin [78] Synthesis of communicating behavior, in Mathematical foundations of computer science 1978, Springer-Verlag Lecture Notes in Computer Science No. 64Google Scholar
  8. Plotkin, G. [76] A powerdomain construction, SIAM Journal of Computing 5Google Scholar
  9. Smyth, M. B. [78] Power domains, Jour. of Comp. and System Sciences 16, pp. 23–36Google Scholar
  10. Stoy, J. [77] Denotational semantics of Programming Languages, MIT pressGoogle Scholar
  11. Tennent, R. D. [76] The denotational semantics of programming languages, CACM 19 pp. 437–453Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Jerald S. Schwarz
    • 1
  1. 1.Dept. of Computer and Communication SciencesUniversity of MichiganAnn Arbor

Personalised recommendations