Squeezing intermediate construction in equational programs

Abstract

In this paper we give a general introduction to the particulax problems associated with partial evaluation of intermediate code for equational programs, and propose some criteria for deciding whether an unfolding strategy is good enough from a practical standpoint. We then present a new algorithm for driving unfolding of EM code programs, and show that, in addition to terminating, it produces a good result. As we have already implemented the new strategy, this final point is demonstrated with a number of concrete examples.