Continuation-Based Program Transformation Strategies

Abstract

Program transformations often revolve the generahzation of a function to take additional arguments It is shown that m many eases such an additional variable arises as a representation of the continuation or global context m which the function is evaluated. By considering continuations, local transformation strategies can take advantage of global knowledge The general results are followed by two examples' the a-fl tree pruning algorithm and an algorithm for the conversion of a propositional formula to conjunctive normal form. © 1980, ACM. All rights reserved.