An approach to determinacy proofs

It is known that any parallel program graph composed of continuous operators itself represents a continuous function. In other words, the network is determinate in the sense that for a given input, the output is unique, independent of the timing of the constituent operators. This result is applied to some unusual data types, resulting in a determinacy proof for a parallel version of the alpha-beta minimax procedure. The notion of the context of a function is introduced, and its usefulness in constructing such proofs is demonstrated.