On the determinacy of schemata
Peter J. Denning · 1970
A number of schemata models for parallel computation have been proposed and studied over the last few years. One's first order of business when studying these models is specifying conditions under which the schemata evoke determinate computations. This paper is an attempt to abstract the properties of determinacy and prove one theorem, good for all schema models satisfying certain axioms.