|
Abstract : |
Summary. The accumulation strategy consists of generalizing a function by inclusion of an extra parameter, an accumulating parameter, for reusing and propagating intermediate results. It has gained a wide interest in the design of efficient programs. In this paper, we shall formulate accumulations as higher order catamorphisms, and propose several general transformation rules for calculating accumulations by calculation-based program transformation methods. Several examples are given for illustration. 1, |
