Haskell

The official Haskell blog has published a new article laying out the differences between foldl and foldr, the two core recursion functions used to reduce lists in the functional programming language. The piece explains how the two differ in evaluation order and laziness, a distinction that matters for performance and for avoiding runtime errors on large or infinite lists. Developers in the programming community are sharing and discussing the explainer.