[Haskell-cafe] monad combinator

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 (=<<). Christian