Finite Differencing of Computable Expressions
Editor(s)
Graham, Susan L.
Abstract
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.
Recommended Citation
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 https://doi.org/10.1145/357172.357177
Department(s)
Mathematics and Statistics
Keywords and Phrases
program transformation; differentiable expression
International Standard Serial Number (ISSN)
0164-0925
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 1982 Association for Computing Machinery (ACM), All rights reserved.
Publication Date
01 Jan 1982
