A variety of matters related to formal differentiation are considered. First, an algebraic approach to formal differentiation of a class of set theoretic expressions is suggested. Then the application of formal differentiation to loop fusion is discussed. Finally, formal differentiation is applied to optimization of incremental construction of composite objects satisfying a given Predicate. The techniques developed are illustrated by transformational construction of a variety of algorithms.
|Number of pages
|ACM Transactions on Programming Languages and Systems
|Published - 1 Apr 1982