Left-right fold equivalence
ID: left-right-fold-equivalence
For finite lists, if and , then the right fold with step and seed equals the left fold with step and seed . The two steps need not be identical. Equality of the resulting values does not imply equal time complexity; list concatenation is an important example.
New to topics? Read the docs here!