Abstract
In the paper a notion of parallel program scheme is introduced. Interpretations of such schemes are defined in two steps: first, independently of instructions meaning, to each scheme a language over the set of all instructions is assigned; second, for a given interpretation of instructions, to each such a language a function is assigned, being the intended interpretation of the scheme. This construction allows to obtain a satisfactory interpretation of parallel components of recursive schemes. The parallel composition of languages is introduced and some properties of this notion are given. It is shown how the theory of recursive procedures can be extended to procedures containing parallel operations. An example shows an application of the above approach.
Preview
Unable to display preview. Download preview PDF.
References
Strachey, C. and Wadsworth, C., Continuations:A mathematical semantics for handling full jumps, Technical Monograph RPG-11, Oxford University Computing Laboratory (1974)
Blikle, A., Equations in the space of languages, CC PAS Reports, Warsaw, (1973)
Scott, D. and Strachey, C., Toward a mathematical semantics for computer languages, Technical Monograph RPG-6, Oxford University Computing Laboratory (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mazurkiewicz, A. (1975). Parallel recursive program schemes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_183
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_183
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive