Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in fold

"Any function on finite lists that is defined by pairing the desired result with the argument list can always be redefined in terms of fold"

What is the connection between primitive recursion and catamorphisms?

How can a variadic template be used to generate a left-associative expression (aka left fold) in c++11?

Why does this first Haskell function FAIL to handle infinite lists, while this second snippet SUCCEEDS with infinite lists?

How is foldl lazy?

terminating a monadic fold early

haskell monads fold

What is the purpose of trailing lambda syntax (Kotlin)?

lambda kotlin fold

Folding list of options

f# optional fold

How do I break out of a pure loop in Haskell without hand-written recursion?

haskell recursion fold

Fold/reduce over List of Futures with associative & commutative operator

Haskell - strict vs non-strict with foldl

Real world examples of using reduceRight in JavaScript

Fold expression with comma operator and variadic template parameter pack

Why doesn't passing Nil to foldLeft work?

scala type-inference fold

Map, Filter, Foldr in DrRacket/Scheme

Since "fold" isn't powerful enough to write a tree pretty-printer with indentation, what high-order combinator is?

How to implement delete with foldr in Haskell

haskell fold

Please explain in the simplest, most jargon-free English possible, the "universal property of fold"?

How to break out from a fold function in haskell when the accumulator met a certain condition?

foldr and foldl further explanations and examples