Parallel algorithms for adaptive quadrature II metalgorithm correctness

This paper introduces a rather specific metalgorithm (or meta-program) for a class of algorithms for adaptive quadrature on parallel (MIMD) computers. This class includes all the current approaches to adaptive quadrature. The main result is that any member of this metalgorithm satisfies the conditions of a traditional numerical analysis convergence theorem from [2]. The algorithm structure in this metalgorithm is specified in some detail and 32 Attributes are assumed. These Attributes and structure serve to guide the design of particular algorithms. They also facilitate establishing algorithm correctness by providing a detailed set of algorithm properties (most of which are like \"assertions\" in program proving) that are sufficient for correctness.