category-extras-0.50.3: Various modules and constructs inspired by category theoryContentsIndex
Control.Functor.Composition
Portabilitynon-portable (class-associated types)
Stabilityexperimental
MaintainerEdward Kmett <ekmett@gmail.com>
Description
Generalized functor composeosition.
Documentation
newtype CompF f g a
Constructors
CompF
runCompF :: f (g a)
show/hide Instances
Composition CompF
(Functor f, Functor g) => Functor (CompF f g)
(Full f, Full g) => Full (CompF f g)
(ExpFunctor f, ExpFunctor g) => ExpFunctor (CompF f g)
class Composition o where
Methods
decompose :: (f `o` g) x -> f (g x)
compose :: f (g x) -> (f `o` g) x
show/hide Instances
associateComposition :: (Functor f, Composition c) => c (c f g) h a -> c f (c g h) a
coassociateComposition :: (Functor f, Composition c) => c f (c g h) a -> c (c f g) h a
type :.: = CompF
data Comp p f g a b
show/hide Instances
(Bifunctor p Hask Hask Hask, Symmetric Hask f, Symmetric Hask g) => Symmetric Hask (Comp p f g)
(Bifunctor p Hask Hask Hask, Braided Hask f, Braided Hask g) => Braided Hask (Comp p f g)
(Bifunctor p c d Hask, QFunctor f b c, QFunctor g b d) => QFunctor (Comp p f g) b Hask
(Bifunctor p c d Hask, PFunctor f a c, PFunctor g a d) => PFunctor (Comp p f g) a Hask
(Bifunctor p c d Hask, Bifunctor f a b c, Bifunctor g a b d) => Bifunctor (Comp p f g) a b Hask
(Bifunctor p Hask Hask Hask, Bifunctor f Hask Hask Hask, Bifunctor g Hask Hask Hask) => Functor (Comp p f g a)
type :++: = Comp Either
type :**: = Comp (,)
liftComp :: Bifunctor p r s Hask => r (f a b) (f c d) -> s (g a b) (g c d) -> Comp p f g a b -> Comp p f g c d
Produced by Haddock version 2.1.0