cartesian-profunctors
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Profunctor.Day

Documentation

data Day (t :: Type -> Type -> Type) (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) a b where Source #

Constructors

Day :: forall (p :: Type -> Type -> Type) a1 b1 (q :: Type -> Type -> Type) a2 b2 a (t :: Type -> Type -> Type) b. p a1 b1 -> q a2 b2 -> (a -> t a1 a2) -> (t b1 b2 -> b) -> Day t p q a b 

Instances

Instances details
ProfunctorFunctor (Day t p :: (Type -> Type -> Type) -> Type -> Type -> Type) Source # 
Instance details

Defined in Data.Profunctor.Day

Methods

promap :: forall (p0 :: Type -> Type -> Type) (q :: Type -> Type -> Type). Profunctor p0 => (p0 :-> q) -> Day t p p0 :-> Day t p q #

Profunctor (Day t p q) Source # 
Instance details

Defined in Data.Profunctor.Day

Methods

dimap :: (a -> b) -> (c -> d) -> Day t p q b c -> Day t p q a d #

lmap :: (a -> b) -> Day t p q b c -> Day t p q a c #

rmap :: (b -> c) -> Day t p q a b -> Day t p q a c #

(#.) :: forall a b c q0. Coercible c b => q0 b c -> Day t p q a b -> Day t p q a c #

(.#) :: forall a b c q0. Coercible b a => Day t p q b c -> q0 a b -> Day t p q a c #

Functor (Day t p q a) Source # 
Instance details

Defined in Data.Profunctor.Day

Methods

fmap :: (a0 -> b) -> Day t p q a a0 -> Day t p q a b #

(<$) :: a0 -> Day t p q a b -> Day t p q a a0 #