The Comonad.Reader » Representing Applicatives…

]]>GHCi then gives:

swap . traverse swap

:: (Applicative (p a), Traversable t, Symmetric p) =>

t (p b a) -> p (t b) a

and we can instantiate p with Either (and clean up a bit) to get:

swap . traverse swap

:: (Traversable t) =>

t (Either a b) -> Either (t a) b

The Comonad.Reader » Zapping Adjunctions…

]]>The Comonad.Reader » Zapping Adjunctions…

]]>I was looking for the Free type on the package indicated in the post, but it seems that in the latest version there’s no Control.Monad.Trans.Free subpackage.

Was it moved somewhere else?

Thanks.

]]>click here for best information on get forever recovery around…

]]>The Comonad.Reader » Abstracting with Applicatives…

]]>BTW, it was really inspiring as well as humbling to meet you today at the Lamdbda Jam in Brisbane. Hope we get to chat some more tomorrow :)

]]>Typographical remark: Several of your lambdas have extra backslashes at the start.

]]>