#ifndef MIN_VERSION_comonad
#define MIN_VERSION_comonad(x,y,z) 1
#endif
#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702
#if MIN_VERSION_comonad(3,0,3)
#else
#endif
#endif
module Data.Semifunctor.Braided
( Braided(..)
, kleisliBraid
, cokleisliBraid
, Symmetric
, swap
) where
import Prelude hiding ((.), id)
import Control.Arrow
import Control.Comonad
import Data.Functor.Bind
import Data.Functor.Extend
import Data.Semifunctor
import Data.Semifunctor.Associative
class Associative k p => Braided k p where
braid :: k (p(a,b)) (p(b,a))
instance Braided (->) (Bi Either) where
braid (Bi (Left a)) = Bi (Right a)
braid (Bi (Right a)) = Bi (Left a)
instance Braided (->) (Bi (,)) where
braid (Bi (a,b)) = Bi (b,a)
kleisliBraid :: (Monad m, Semifunctor p (Product (Kleisli m) (Kleisli m)) (Kleisli m), Braided (->) p) => Kleisli m (p(a,b)) (p(b,a))
kleisliBraid = Kleisli (return . braid)
instance (Bind m, Monad m) => Braided (Kleisli m) (Bi Either) where
braid = kleisliBraid
instance (Bind m, Monad m) => Braided (Kleisli m) (Bi (,)) where
braid = kleisliBraid
cokleisliBraid :: (Extend w, Comonad w, Semifunctor p (Product (Cokleisli w) (Cokleisli w)) (Cokleisli w), Braided (->) p) =>
Cokleisli w (p(a,b)) (p(b,a))
cokleisliBraid = Cokleisli (braid . extract)
instance (Extend w, Comonad w) => Braided (Cokleisli w) (Bi (,)) where
braid = cokleisliBraid
class Braided k p => Symmetric k p
instance Symmetric (->) (Bi Either)
instance Symmetric (->) (Bi (,))
instance (Bind m, Monad m) => Symmetric (Kleisli m) (Bi Either)
instance (Bind m, Monad m) => Symmetric (Kleisli m) (Bi (,))
instance (Extend w, Comonad w) => Symmetric (Cokleisli w) (Bi (,))
swap :: Symmetric k p => k (p(a,b)) (p(b,a))
swap = braid