[Haskell-cafe] Haskell maximum stack depth
ndmitchell at gmail.com
Thu Feb 7 11:56:22 EST 2008
> But the point is that *both* heapGobbler and neilGobbler are likely to
> be slower and chew through at least twice as much heap as stackGobbler,
> which would be the implementation of choice for both simplicity and
> performance if it wasn't for this stack management problem.
Sure? That sounds like the thing that people can conjecture, but
benchmarks can prove. And I'd claim that neilGobbler is the simplest
function by a large margin.
More information about the Haskell-Cafe