On Wed, 7 Dec 2005, J. Garrett Morris wrote: > On 12/7/05, Robin Green <[EMAIL PROTECTED]> wrote: > > Let's say you want to write a function > > > > seqPair :: (Monad m) => (m a, m b) -> m (a, b) > > > > which returns a computation which does the left computation followed by the > > right computation (i.e. it's like the sequence function, but for pairs > > instead of lists). > > In this case, I believe it is as simple as > > import Control.Monad (liftM2) > > seqPair = liftM2 (,)
seqPair = uncurry (liftM2 (,)) _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
