Bernard Pope <[EMAIL PROTECTED]> writes: > I also meant to add that I think these solutions are not what Lloyd is > after, because they rely on recursive equations, which I believe was > avoided in Lloyd's SML code.
Those recursive equations are avoided in SML because SML is eager - y f = f (y f) never terminates - and an SML programmer has to thunk by hand; the obfuscation shows. In Haskell there is no such need. _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
