3 ms·

An algorithm that's idiomatic in one language might be terribly unidiomatic in another. (I'm sure you know this, but) Haskell's pervasive laziness makes some al

• igouy 14y ago
  The benchmarks game URL was posted by someone who has put a lot of energy into promoting Haskell - dons makes the best of the opportunity that the benchmarks game provides to promote Haskell. >>pervasive laziness... requiring a lot of space/time complexity for other algorithms<< And GHC provides strictness analysis and explicit strictness to avoid reducing performance. http://www.haskell.org/haskellwiki/Performance/Strictness http://www.haskell.org/haskellwiki/Performance/Strictness
• igouy 14y ago
  >>I need some sort of shock collar to teach me not to argue about the worth of the Computer Language Benchmarks Game.<< Do argue - but argue better. Unfortunately, to argue better does require learning what the website says about the benchmarks game - and for most that's far too much effort.