6 ms·
As the article explains, fold functions are a simpler way to think about monoids. So in recursive pure functional programming, many important iterative processe
by TuringTest 2y ago
As the article explains, fold functions are a simpler way to think about monoids. So in recursive pure functional programming, many important iterative processes (pipelines, accumulators, machine states...) can be expressed as an application of fold-l or fold-r.