Koen Claessen <[EMAIL PROTECTED]> writes:
> Take a look at the following "program snippet" (a very
> popular word at last week's ICFP :-):
> <PRE>
> > bfReplace :: [b] -> Tree a -> Tree b
> > bfReplace xs = deQ . bfReplaceQ xs . singletonQ
> </PRE>
> Now we just have to define <B>bfReplaceQ</B>.
If the goal is to conserve lines, might I suggest:
Take a look at the following "program snippet" (a very
popular word at last week's ICFP :-): <PRE>
> bfReplace :: [b] -> Tree a -> Tree b
> bfReplace xs = deQ . bfReplaceQ xs . singletonQ
</PRE>Now we just have to define <B>bfReplaceQ</B>.
-kzm
--
If I haven't seen further, it is by standing in the footprints of giants
