Finite Differencing of Computable Expressions
Graham, Susan L.
Finite differencing is a program optimization method that generalizes strength reduction, and provides an efficient implementation for a host of program transformations including "iterator inversion." Finite differencing is formally specified in terms of more basic transformations shown to preserve program semantics. Estimates of the speedup that the technique yields are given. A full illustrative example of algorithm derivation is presented.
R. Paige and S. Koenig, "Finite Differencing of Computable Expressions," ACM Transactions on Programming Languages and Systems, Association for Computing Machinery (ACM), Jan 1982.
The definitive version is available at http://dx.doi.org/10.1145/357172.357177
Mathematics and Statistics
Keywords and Phrases
program transformation; differentiable expression
Article - Journal
© 1982 Association for Computing Machinery (ACM), All rights reserved.