James Miller:
I wish I could love Haskell, and for pure computer science,
it's fine, amazing even, but for real-world programming,
it just doesn't cut it.
Haskell contains some ideas worth copying even in non-functional
languages (or in mixed languages as D).
Enforced purity and immutability, lazy immutable lists, pattern
matching, tuples and their various unpacking syntax, list
comprehension, structural algebraic types, built-in currying and
partial application, and so on, are handy and allow to express
certain computing idioms in a succinct and clear way (and not
every part of a program needs the same runtime efficiency). Scala
language shows that you can put several of those things in a
language that supports mutability too.
Bye,
bearophile
