3 ms·
> With Haskell this isn't an issue because lists are evaluated lazily Even more than that, the compiler will actually do things like replace map f . map g
by wyager 10y ago
> With Haskell this isn't an issue because lists are evaluated lazily
Even more than that, the compiler will actually do things like replace
map f . map g
with
map (f . g)
To eliminate unnecessary allocations.
- rubberstamp 10y agoThats great. My greatest petpeevee is having to keep in mind the language gotchas when all I want to do is get it done.
- Peaker 10y agoHaskell has far fewer correctness gotchas than other languages. They stuck to consistent, predictable behavior - even when it made things tedious for years until new techniques were discovered. Haskell does have performance gotchas, though.