Safe Haskell	None
Language	Haskell2010

FFunctor.Tannen

Synopsis

newtype Tannen (h :: FUNCTOR) (ff :: FF) (g :: FUNCTOR) x = Tannen {
- runTannen :: h (ff g x)
}

Documentation

newtype Tannen (h :: FUNCTOR) (ff :: FF) (g :: FUNCTOR) x Source #

Wraps a FFunctor ff inside a Functor h.

This can be thought of as a functor composition below.

(Functor × Type) -[ff]-> Type -[h]-> Type

The name Tannen is an homage to Data.Bifunctor.Tannen in bifunctors package, which works in a similar way: taking Bifunctor p and Functor h, makes Bifunctor by the composition below.

(Type × Type) -[p]-> Type -[f]-> Type

Constructors

Tannen
Fields runTannen :: h (ff g x)

Instances

Instances details

(Functor h, FFunctor ff) => FFunctor (Tannen h ff) Source #
Instance details Defined in FFunctor.Tannen Methods ffmap :: forall (g :: Type -> Type) (h0 :: Type -> Type) x. (Functor g, Functor h0) => (g ~> h0) -> Tannen h ff g x -> Tannen h ff h0 x #
(Functor h, Functor (ff g)) => Functor (Tannen h ff g) Source #
Instance details Defined in FFunctor.Tannen Methods fmap :: (a -> b) -> Tannen h ff g a -> Tannen h ff g b # (<$) :: a -> Tannen h ff g b -> Tannen h ff g a #