>Haskell is a lazy language, with which we are supposed to ignore when (or 
>whether) an expression is going to be evaluated, at least most of the 
>time. As the result we have to give up all the side effects (i.e., I/O and 
>destructive data updates), because we have no idea on the order in which 
>these side effects occur. On the other hand, the ML family is strict.

People who complain that o'caml does not have a fixed evaluation order on 
function arguments should take a look at Haskell, things are much worse 
there. :-)

Hao-yang Wang