Higher-Order and Symbolic Computation

, Volume 21, Issue 1, pp 37–58

Imperative-program transformation by instrumented-interpreter specialization


DOI: 10.1007/s10990-008-9027-3

Cite this article as:
Debois, S. Higher-Order Symb Comput (2008) 21: 37. doi:10.1007/s10990-008-9027-3


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.


Partial evaluationInterpretive approachProgram transformationCode duplicationMoore automata

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.IT University of CopenhagenCopenhagen SDenmark