Abstract

This papers describes a transformation from lazy functions into efficient non-lazy ones. The functions we study perform multiple traversals over a data structure. Our transformation performs a global analysis of the calling structure of a set of mutually recursive lazy-functions in order to transform them into sets of functions which must be called in sequence. Many of the resulting functions can be eliminated by the optimizations presented in this paper. We present measurements that show that transformed and optimized functions allow efficient incremental execution. The paper contains examples that were automatically constructed with a generator of incremental functional programs. 1 Introduction One of the more intricate parts of the world of functional programming deals with the construction of so-called circular programs, with the program repmin of Bird acting as the canonical representative of this class [Bir84]. For almost everyone, when first introduced to such programs, it take...

Citations