I've been using externally driven recursion quite a lot in some toy programs lately, and it is extremely helpful when profiling different memoization schemes. W

I've been using externally driven recursion quite a lot in some toy programs lately, and it is extremely helpful when profiling different memoization schemes. Where once you would have had to change a sizable chunk of your explicitly recursive function, now you can simply use combinators to generate different implementations, be it for profiling purposes, or even runtime optimization :) -- General implementation type T = Int -> Set [Int] g :: T -> T ... g' = fix g -- Very slow g'' = memoFix integral g -- Fast, Generic g''' = memoFix integer g -- Fast enough to use On a side note, the paper seems too readable to me! Usually these kinds of topics are presented in such a way as to make them almost completely incomprehensible. Something must be very wrong here. [edit: How do you quote code?]