Full laziness

A transformation, described by Wadsworth in 1971, which ensures that subexpressions in a function body which do not depend on the function's arguments are only evaluated once. See also fully lazy lambda lifting, let floating.

Free Online Dictionary of Computing