
12 Jul
2005
12 Jul
'05
5:02 a.m.
Bernard Pope wrote:
I'll be a little bit pedantic here. Haskell, the language definition, does not prescribe lazy evaluation. It says that the language is non-strict. Lazy evaluation is an implementation technique which satisfies non-strict semantics, but it is not the only technique which does this.
This pedantry is renewed periodically. It is a pity that nobody ever writes anything about that other methods of implementation of non-strictness, nor about the languages which use those methods. I believe it might do some good to people who learn functional programming in general, and Haskell in particular. Any takers? Jerzy Karczmarczuk