
20 Apr
2014
20 Apr
'14
9:10 p.m.
Edward Kmett
writes:
However, given that they keep getting reinvented with the exact same names and functionality. I'm finally ready to give in.
+1 from me.
How about a more general combinator, like om (name needed)? om :: Monad m => (a -> b -> m c) -> m a -> b -> m c om f m = (m >>=) . flip f whenM = om when unlessM = om unless etc. John