Ar. Omondi et Da. Plaisted, A MODEL FOR THE PARALLEL EXECUTION OF SUBSET-EQUATIONAL LANGUAGES, Future generations computer systems, 11(3), 1995, pp. 295-320
This paper describes a model for the parallel execution of subset-equa
tional languages, a class of functional languages that allow constrain
ed nondeterminism. The fundamentals of subset-equational languages are
presented, followed by the formulation of a kernel language that is u
sed as the basis of the model. The languages are based on nondetermini
stic term-rewriting systems; the model uses dataflow execution graphs
and is suitable for implementation on both conventional and unconventi
onal machines.