Control.Bifunctor.Braided

Documentation

module Control.Bifunctor.Associative

class Bifunctor p => Braided p where

A braided (co)(monoidal or associative) category can commute the arguments of its bi-endofunctor. Obeys the laws:

 idr . braid = idl 
 idl . braid = idr 
 braid . coidr = coidl 
 braid . coidl = coidr 
 associate . braid . associate = second braid . associate . first braid 
 coassociate . braid . coassociate = first braid . coassociate . second braid 

Methods

braid :: p a b -> p b a

Instances

Braided Either

Braided (,)

Braided p => Braided (SwapB p)

(Functor f, Braided p) => Braided (FunctorB f p)

(Bifunctor p, Braided f, Braided g) => Braided (CompB p f g)

(Functor f, Braided p) => Braided (BiffB p f f)

class Braided p => Symmetric p

If we have a symmetric (co)Monoidal category, you get the additional law:

 swap . swap = id

Instances

Symmetric Either

Symmetric (,)

Symmetric p => Symmetric (SwapB p)

(Functor f, Symmetric p) => Symmetric (FunctorB f p)

(Bifunctor p, Symmetric f, Symmetric g) => Symmetric (CompB p f g)

(Functor f, Symmetric p) => Symmetric (BiffB p f f)

swap :: Symmetric p => p a b -> p b a