Abstract
The Church-Rosser property shows that functional program terms that are not contained in each other may be evaluated (rewritten) in any order without affecting the determinacy of results. Thus they can also be evaluated non-sequentially2, under the control of individual processes (or tasks), in a system of several processing sites. All it takes to do so are some means to partition a program into concurrently executable (sub-)terms, and to compose, in reverse order, an evaluated program from evaluated (sub-)terms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this chapter
Cite this chapter
Kluge, W. (1999). Realisations for Strict Languages. In: Hammond, K., Michaelson, G. (eds) Research Directions in Parallel Functional Programming. Springer, London. https://doi.org/10.1007/978-1-4471-0841-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0841-2_5
Publisher Name: Springer, London
Print ISBN: 978-1-85233-092-7
Online ISBN: 978-1-4471-0841-2
eBook Packages: Springer Book Archive