|
Abstract : |
Summary. Accumulations are operators on structured object that proceed their computation on each element of the object keeping some intermediate results. Accumulations are widely used in the design of efficient sequential and parallel programs. The purpose of this paper is to deal with the transformation on accumulations so that more efficient programs can be derived. We formulate accumulations by means of higher order catamorphisms and propose a promotion theorem for accumulations. Some examples are given to explain our method. 1, |
