On Wed, 23 Nov 2005, Udo Stenzel wrote:
Scherrer, Chad wrote:
Maybe my point wasn't clear. Of course this idea of comparing lazy
evaluation to Unix pipes is very old (long before July 2004, I'm sure).
The point I'm making is that there is an old idea that may be underused.
It is, and only because (.) is defined all wrong!
Since
(a . b) x
a $ b x
a (b x)
are equivalent, do you also want to reverse function and argument in order
to match argument order of . and $ ?
That is
x (b . a)
x b $ a
(x b) a
?
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
