“Using Circular Programs to Eliminate Multiple Traversals of Data”, Richard S. Bird1984 (Haskell)⁠:

This paper describes a technique for transforming functional programs that repeatedly traverse a data structure into more efficient alternatives that do not [the repmin problem].

The transformation makes essential use of lazy evaluation and local recursion (such as provided by letrec, or its equivalent) to build a circular program that, on one pass over the structure, determines the effects of the individual traversals and then combines them.