There it is. I noticed it was 2005 but didn't think of this. I was trying very hard to understand statements like: >Now.. with those definitions in place, you

There it is. I noticed it was 2005 but didn't think of this. I was trying very hard to understand statements like: >Now.. with those definitions in place, you can see how the relationship between simultaneity and lazy evaluation isn't quite as simple as it appears at first glance. It's theoretically possible that the 'f()' or 'x' might change between the lazy evaluation of step one and the lazy evaluation of step three million. Trying to prevent that is what we programmers call a 'hard' problem. It only makes sense if you don't consider Haskell to be the most immediate example for lazy, purely functional programming.