> Do Haskell programmers have good intuition about performance? It seems like laziness would make it hard? Laziness in data structures usually gives you good e

> Do Haskell programmers have good intuition about performance? It seems like laziness would make it hard? Laziness in data structures usually gives you good enough performance in most cases, but harder to make sure it's consistent and reason about when you need to adjust it. For common operations with an average requirement of performance, laziness seems to give the developer an easier chance of good performance, with the higher possibility to screw it up if the requirement is really strict.