Explains tail-recursion using the Fibonacci series in C#, comparing performance and stack usage with regular recursion.
Explains tail recursion and techniques like accumulating parameters to prevent stack overflows in functional programming.
Benchmarks comparing Haskell list length implementations, showing how strict tail recursion with accumulating parameters improves performance and memory safety.
The article argues for the importance of recursion in functional programming, specifically F#, countering common misconceptions about its inefficiency.
Explains tail recursion optimization in C#, its absence in the compiler, and workarounds like the trampoline technique to prevent stack overflows.
