Parallel processing and OOP as an analogy for the discovery of certain mathematical proofs

This paper presents a heuristic methodology that can be used to discover (and/or better understand) proofs of some mathematical theorems, when the statement of the theorem involves a set for which every element should be “processed.” This heuristic, which has a number of interesting connections with recent trends in computer program design, is called the Method of Uniform Parallel Object-Modules, after the concepts of modularization, parallel processing, and object oriented programming.