Haskell lists should be thought of like (pure immutable) iterators. They have the same cache-misses and possibly-infinite properties. One could argue that the

Haskell lists should be thought of like (pure immutable) iterators. They have the same cache-misses and possibly-infinite properties. One could argue that the mistake Haskell made was to call them "lists" instead of "streams", and to make it so easy to make list literals.