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? _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
