<div dir="ltr">You could do:<div><br></div><div style>runKleisli . mconcat . map Kleisli :: Monoid (Kleisli m a b) => [a -> m b] -> a -> m b</div><div style><br></div><div style>Would that work for you?</div></div>
<div class="gmail_extra"><br><br><div class="gmail_quote">On Tue, Apr 16, 2013 at 8:35 PM, Christopher Howard <span dir="ltr"><<a href="mailto:christopher.howard@frigidcode.com" target="_blank">christopher.howard@frigidcode.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">So, I'm doing something like this<br>
<br>
foldl (>>=) someA list :: Monad m => m a<br>
<br>
where<br>
list :: Monad m => [a -> m a],<br>
someA :: Monad m => m a<br>
<br>
Is there a more concise way to write this? I don't think foldM is what I<br>
want -- or is it?<br>
<span class="HOEnZb"><font color="#888888"><br>
--<br>
<a href="http://frigidcode.com" target="_blank">frigidcode.com</a><br>
<br>
</font></span><br>_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
<br></blockquote></div><br></div>