class (Monad m, Monad m’) => Bippy m m’ where seq :: m’ (m a) -> m (m’ a) Does “Bippy” exist and what is it called?
-
-
Replying to @djspiewak
@djspiewak What if: class Monad m => Bippy m where seq :: Monad m’ => m’ (m a) -> m (m’ a) Can that be implemented? How about with lift?2 replies 0 retweets 0 likes -
Replying to @mergeconflict
@mergeconflict I’m pretty sure that’s less powerful, since you must allow sequencing through *arbitrary* m’.3 replies 0 retweets 0 likes -
Replying to @djspiewak
@djspiewak actually, now I'm wondering whether it's possible to implement seq for any pair of monads, just in terms of their >>= and return?5 replies 0 retweets 0 likes
Replying to @mergeconflict
@mergeconflict @djspiewak And can't be just in terms of >>= and return.
2:56 PM - 11 Jan 2013
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.