Modulebifunctors-5.6.3Haskell2010

Data.Bifunctor.Functor

typetype (:->) (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) = forall (a :: k) (b :: k1). p a b -> q a b

Using parametricity as an approximation of a natural transformation in two arguments.

classclass BifunctorFunctor (t :: (k -> k1 -> Type) -> k2 -> k3 -> Type) where

Instances4BifunctorFunctor

BifunctorFunctor FlipDefined in bifunctors-5.6.3 · Data.Bifunctor.Flip
BifunctorFunctor (Product p)Defined in bifunctors-5.6.3 · Data.Bifunctor.Product
BifunctorFunctor (Sum p)Defined in bifunctors-5.6.3 · Data.Bifunctor.Sum
Functor f => BifunctorFunctor (Tannen f)Defined in bifunctors-5.6.3 · Data.Bifunctor.Tannen

classclass BifunctorFunctor t => BifunctorMonad (t :: (k -> k1 -> Type) -> k -> k1 -> Type) where

Instances2BifunctorMonad

BifunctorMonad (Sum p)Defined in bifunctors-5.6.3 · Data.Bifunctor.Sum
(Functor f, Monad f) => BifunctorMonad (Tannen f)Defined in bifunctors-5.6.3 · Data.Bifunctor.Tannen

valuebiliftM :: BifunctorMonad t => p :-> q -> t p :-> t q

classclass BifunctorFunctor t => BifunctorComonad (t :: (k -> k1 -> Type) -> k -> k1 -> Type) where

Instances2BifunctorComonad

BifunctorComonad (Product p)Defined in bifunctors-5.6.3 · Data.Bifunctor.Product
Comonad f => BifunctorComonad (Tannen f)Defined in bifunctors-5.6.3 · Data.Bifunctor.Tannen

valuebiliftW :: BifunctorComonad t => p :-> q -> t p :-> t q