Realisations for Strict Languages

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-sequentially, 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.