| >Haskell performance is very good when written by people who know how the compiler works I know nothing about how the compiler works, and my haskell code still easily outperforms my clojure code. The only optimizations I do are the same as anywhere else: profile and look at functions taking up too much time. >and know the bytecode they want generated. Bytecode is not involved. Machine code is, but I don't even know ASM to know what I want generated or if it is being generated that way. >When you need them, there is no real substitute for unboxed mutable arrays, something Haskell does NOT make easy. This is simply nonsense. Unboxed mutable vectors are trivial in haskell: https://hackage.haskell.org/package/vector-0.10.11.0/docs/Da... No, there is no substitute for using the right data types. Why do you think haskell or haskellers suggest using the wrong data types? |
I didn't say you couldn't do arrays with Haskell, I said Haskell doesn't make it easy. Here are the actual array docs, BTW: http://www.haskell.org/haskellwiki/Arrays