Contents
Index
hs-functors-0.1.1.0: Functors from products of Haskell and its dual to Haskell
Index
&&&
Data.Profunctor
***
Data.Profunctor
+++
Data.Profunctor
<<=
Control.Comonad
<<^
Data.Profunctor
=<=
Control.Comonad
=>=
Control.Comonad
=>>
Control.Comonad
>$
Data.Functor.Contravariant
>$<
Data.Functor.Contravariant
>>^
Data.Profunctor
braid
Data.Bifunctor.Braided
Braided
Data.Bifunctor.Braided
Closed
Data.Profunctor
closed
Data.Profunctor
Cokleisli
1 (Type/Class)
Control.Comonad
2 (Data Constructor)
Control.Comonad
colift
Control.Comonad.Trans.Class
collect
Data.Cotraversable
Comonad
Control.Comonad
ComonadTrans
Control.Comonad.Trans.Class
ComposeT
1 (Type/Class)
Control.Monad.Trans.Compose
2 (Data Constructor)
Control.Monad.Trans.Compose
copure
Control.Comonad
cosequence
Data.Cotraversable
Costrong
Data.Profunctor
costrongL
Data.Profunctor
costrongR
Data.Profunctor
Cotraversable
Data.Cotraversable
cotraverse
Data.Cotraversable
cut
Control.Comonad
dimap
Data.Profunctor
Functor
Data.Functor.Contravariant
getComposeT
Control.Monad.Trans.Compose
gmap
Data.Functor.Contravariant
lmap
Data.Profunctor
mbind
Control.Monad.Morph
MFunctor
Control.Monad.Morph
mjoin
Control.Monad.Morph
mmap
Control.Monad.Morph
MMonad
Control.Monad.Morph
Op1
1 (Type/Class)
Data.Functor.Contravariant
2 (Data Constructor)
Data.Functor.Contravariant
op1
Data.Functor.Contravariant
Op2
1 (Type/Class)
Data.Functor.Contravariant
2 (Data Constructor)
Data.Functor.Contravariant
op2
Data.Functor.Contravariant
Profunctor
Data.Profunctor
rmap
Data.Profunctor
runCokleisli
Control.Comonad
Strong
Data.Profunctor
strong
Data.Profunctor
wfix
Control.Comonad
^<<
Data.Profunctor
^>>
Data.Profunctor
|||
Data.Profunctor