Don't think, just defunctionalize – Blog – Joachim Breitner's Homepage
TL;DR: CPS-conversion and defunctionalization can help you to come up with a constant-stack algorithm. Update: Turns out I inadvertedly plagiarized the talk The Best Refactoring You’ve Never Heard Of by James Koppel. Please consider this a form of sincere flattery. The starting point Today, I’ll take you on a another little walk through the land of program transformations. Let’s begin with a simple binary tree, with value of unknown type in the leaves, as well as the canonical map function: data T a = L a | B (T a) (T a) map1 :: (a -> b) -> T a -> T b
Source: joachim-breitner.de