3 ms·
Well, you can avoid most problems by remembering the following quote: "you usually want your data structures to be as strict as possible, but your control flow
by codygman 11y ago
Well, you can avoid most problems by remembering the following quote:
"you usually want your data structures to be as strict as possible, but your control flow to be as lazy as possible"
Here's something else that might be of interest to you:
http://johantibell.com/files/haskell-performance-patterns.html#%281%29 http://johantibell.com/files/haskell-performance-patterns.ht...
> I've written some Haskell programs and tried very, very hard to make them fast (they were parallelized too).
Can you share these? I'm very interested in a Haskell which is both effective at expressing ideas and logic and is very performant (I also think it's farther along at doing so than you give it credit for).
- banachtarski 11y agoOne important thing about performance is that guaranteeing good throughput and latency are two separate things. I read all the books, all the blogposts and papers; trust me, I did the obvious things. Even if you make your data structures tight, the problem isn't so much that the program runs slow on average. The problem is that it is hard to predict the runtime performance characteristics, let alone guarantee them.