Peter Verswyvelen: > Personally I also find the following a good explanation, since it does > not introduce lambdas or other scary things for newbies. > > f . g = composite > where composite x = f (g x) >
I suppose that the usual definition, which is (f . g) x = f (g x), is clear enough. No lambdas to be scared of here. _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
