Marcelo Lazaroni • 9/9/2017

Faster and safer Haskell - benchmarks for the accumulating parameter

Read Original

This technical article benchmarks three Haskell implementations for calculating list length: a naive lazy version, a tail-recursive version, and a strict tail-recursive version using an accumulating parameter. It demonstrates how the strict, tail-recursive approach prevents stack overflow and excessive memory usage (thunks), making it the fastest and safest option for large lists.

0 comments
#recursion #Benchmarks #Haskell
Faster and safer Haskell - benchmarks for the accumulating parameter

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
Quoting Thariq Shihipar
Simon Willison • 2 votes
2
Top picks — 2026 January
Paweł Grzybek • 1 votes
3
In Praise of –dry-run
Henrik Warne • 1 votes
4
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár • 1 votes
5
Vibe coding your first iOS app
William Denniss • 1 votes
6
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
7
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes