[Haskell-cafe] monad combinator

[Tomasz Zielonka]

On Thu, Feb 16, 2006 at 04:36:06PM +0100, Christian Maeder wrote:
> Udo Stenzel wrote:
> >(*>) :: Monad m => m a -> m b -> m a
> >m *> n = do a <- m ; n ; return a
> 
> Right, that one is really useful. I named it (<<), though, conforming to 
>  (>>=) versus (=<<).

But =<< first executes the second argument...

Best regards
Tomasz

-- 
I am searching for programmers who are good at least in
(Haskell || ML) && (Linux || FreeBSD || math)
for work in Warsaw, Poland