[Haskell-cafe] Question on leazy evaluation

Henning Thielemann lemming at henning-thielemann.de
Thu Mar 24 04:21:30 EST 2005

On Thu, 24 Mar 2005, Pierre Barbier de Reuille wrote:

> My question is: is there some (simple?) rule/criteria to ensure leazy
> evaluation will be efficient ?

 One rule of thumb is: If your implementation works for infinite lists
then it will also be quite efficient for finite lists.
 Do you mean criteria of this kind?

More information about the Haskell-Cafe mailing list