Abstract
We describe how to implement strength reduction, loop-invariant code motion and loop quasi-invariant code motion by specializing instrumented interpreters. To curb code duplication intrinsic to such specialization, we introduce a new program transformation, rewinding, which uses Moore-automata minimization to remove duplicated code.
| Original language | English |
|---|---|
| Journal | Higher-Order and Symbolic Computation |
| Volume | 21 |
| Issue number | 1-2 |
| Pages (from-to) | 37-58 |
| Number of pages | 22 |
| ISSN | 1388-3690 |
| Publication status | Published - 15 Apr 2008 |