If you ask me if a data structure is lazy, I will ask you the boiling point of Pythagora's Theorem and I too, can hold a straight face.
-
@dibblego Haskell has non-strict semantics (by definition), implemented in at least one compiler as lazily evaluation. What's your point?
@guhou I think you mean, function arguments, by default are non-strict in Haskell. Now about that alleged lazy data structure…
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.