> So what does the function
> insert2 val1 val2 =
>let
> (m1,k1) = insert empty (Just val1)
> (m2,k2) = insert m1 (Just val2)
> m3 = update m2 k1 Nothing
>in
> isJust (lookup m3 k2)
> return? It looks to me as if it returns True if val1
On 2003-06-17 at 20:15EDT Derek Elkins wrote:
> The closest function I see is ap :: Monad m => m (a -> b) -> m a -> m b
> (so you could write your function as f fs a = ap fs (return a) not that
> I would recommend it). Also you may want to check out the Haskell
> reference at zvon.org, it's indexe
> >or breakin' out the point-free style,
> > flist = flip (map . flip ($)) -- okay, so I wouldn't recommend this
>
> I keep on reading about this "point free style", but can't find any
> discussion of it. Are there any pointers (sic) ?
Search for "Squiggol" or "Bird-Meertens Formalism". A gr
At 20:15 17/06/03 -0400, Derek Elkins wrote:
On Tue, 17 Jun 2003 21:01:57 +0100
Graham Klyne <[EMAIL PROTECTED]> wrote:
> I'm convinced I've seen a function like this somewhere:
>[a->b] -> a -> [b]
> but cannot remember where. Or maybe:
>Monad m => m (a->b) -> a -> m b
> ?
>
> I could roll
John Hughes <[EMAIL PROTECTED]> writes:
> ICFP Programming Contest
>
>
> There are just ten days to go to the sixth ICFP Programming Contest!
This *is* announced to all relevant groups (as in comp.lang.*, at
least)?
-kzm
--
If I haven't seen further, it is by standing
