> based on just lazy vs eager evaluation.
It's not "just", it's fundamental. We're talking about an efficient implementation, remember? And therefore the underlying execution semantics is the single most important thing for classifying languages. The rest that you listed is very high level, consider it syntax sugar. It is all lowered down long before any of the important optimisations start to kick in.
> So we can see a lot in common there.
Not that much. Just think of the deeply fundamental difference between SECD and, say, STG.
See here[0]:
> Since Haskell is inevitably an ML (descending from Lazy ML) derivative, one might begin by pointing out the similarities:
> While the bread-and-butter language features may be similar, building software in Haskell vs SML is actually quite a different affair:So we can see a lot in common there.
0: http://www.quora.com/What-are-the-key-differences-between-Ha...