the biggest trouble in writing code...

[juan_gandhi]

is not with algorithms; there's hardly any algorithm that is hard to implement, once it's clearly formulated.
And it is probably not even performance, since it is another algorithm issue.

It is our struggle with monads. With monads that don't commute.

That's what makes Haskell so good (and so hard): it makes us to mention monads explicitly.

Comments

[ivan-gandhi.livejournal.com]

No, I'm talking on a much smaller scale. Non-total functions being used as if they were total, for instance.

[wizzard]

Not using them in such a way would require a total description of the surrounding environment, which is impossible.

I think Erlang is just the opposite (reducing complexity by reducing the range of possible inputs)