List fold
= List fold
{title2=`foldr :: (a -> b -> b) -> b -> [a] -> b`}
= Right fold
{synonym}
The <structural recursion> that replaces an empty <list> by a chosen value and a cons constructor by a combining <function> applied to the head and folded tail. A direct <list fold> is strict in the list spine at its outermost constructor, even when the combining function does not demand the folded tail. Its algebraic recognition rule is the <fold factorisation criterion>.