3 ms·
> The time taken by f(g(x)) under lazy evaluation is known to be no more than the time taken under strict evaluation. True but irrelevant (particularly given t
by lmm 7y ago
> The time taken by f(g(x)) under lazy evaluation is known to be no more than the time taken under strict evaluation.
True but irrelevant (particularly given that idiomatic Haskell involves a lot of constructions that would take infinite time under strict evaluation). If x < a, y < b, z < c and a + b = c, that doesn't give you any useful relationship between x, y and z.
- tome 7y agoA fair point. An example would be something like take 10 (map (+1) [1..])