Coroutining Folds with Hyperfunctions
Festschrift for Dave Schmidt, pp. 121-135, 2013.
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper, we explore folds over a form of recursive higher-order function, called hyperfunctions, and show ...More
PPT (Upload PPT)