> technically haskell is non-strict, not lazy. What do you mean by that? > (a + (b * c)) evaluates + then * instead of * then +. AIUI, head 2 [1, 2, (di

> technically haskell is non-strict, not lazy. What do you mean by that? > (a + (b * c)) evaluates + then * instead of * then +. AIUI, head 2 [1, 2, (digit_of_pi 1000000000) ] is forbidden from calculating the billionth digit of pi. That's a pretty strict (play on words intended) kind of laziness, even if not the theoretically maximal definition.