Data.Profunctor.Cayley

Documentation

newtype Cayley f p a b

Constructors

Cayley

Fields

• runCayley :: f (p a b)

Instances

Comonad f => ProfunctorComonad (Cayley f)

Cayley transforms Comonads in Hask into comonads on Prof

Methods

proextract :: Profunctor p => Cayley f p :-> p

produplicate :: Profunctor p => Cayley f p :-> Cayley f (Cayley f p)

(Functor f, Monad f) => ProfunctorMonad (Cayley f)

Cayley transforms Monads in Hask into monads on Prof

Methods

proreturn :: Profunctor p => p :-> Cayley f p

projoin :: Profunctor p => Cayley f (Cayley f p) :-> Cayley f p

Functor f => ProfunctorFunctor (Cayley f)

Methods

promap :: Profunctor p => (p :-> q) -> Cayley f p :-> Cayley f q

(Applicative f, Category * p) => Category * (Cayley f p)

Methods

id :: cat a a

(.) :: cat b c -> cat a b -> cat a c

(Applicative f, Arrow p) => Arrow (Cayley f p)

Methods

arr :: (b -> c) -> Cayley f p b c

first :: Cayley f p b c -> Cayley f p (b, d) (c, d)

second :: Cayley f p b c -> Cayley f p (d, b) (d, c)

(***) :: Cayley f p b c -> Cayley f p b' c' -> Cayley f p (b, b') (c, c')

(&&&) :: Cayley f p b c -> Cayley f p b c' -> Cayley f p b (c, c')

(Applicative f, ArrowZero p) => ArrowZero (Cayley f p)

Methods

zeroArrow :: Cayley f p b c

(Applicative f, ArrowPlus p) => ArrowPlus (Cayley f p)

Methods

(<+>) :: Cayley f p b c -> Cayley f p b c -> Cayley f p b c

(Applicative f, ArrowChoice p) => ArrowChoice (Cayley f p)

Methods

left :: Cayley f p b c -> Cayley f p (Either b d) (Either c d)

right :: Cayley f p b c -> Cayley f p (Either d b) (Either d c)

(+++) :: Cayley f p b c -> Cayley f p b' c' -> Cayley f p (Either b b') (Either c c')

(|||) :: Cayley f p b d -> Cayley f p c d -> Cayley f p (Either b c) d

(Applicative f, ArrowLoop p) => ArrowLoop (Cayley f p)

Methods

loop :: Cayley f p (b, d) (c, d) -> Cayley f p b c

(Functor f, Profunctor p) => Profunctor (Cayley f p)

Methods

dimap :: (a -> b) -> (c -> d) -> Cayley f p b c -> Cayley f p a d

lmap :: (a -> b) -> Cayley f p b c -> Cayley f p a c

rmap :: (b -> c) -> Cayley f p a b -> Cayley f p a c

(#.) :: Coercible * c b => (b -> c) -> Cayley f p a b -> Cayley f p a c

(.#) :: Coercible * b a => Cayley f p b c -> (a -> b) -> Cayley f p a c

(Functor f, Strong p) => Strong (Cayley f p)

Methods

first' :: Cayley f p a b -> Cayley f p (a, c) (b, c)

second' :: Cayley f p a b -> Cayley f p (c, a) (c, b)

(Functor f, Choice p) => Choice (Cayley f p)

Methods

left' :: Cayley f p a b -> Cayley f p (Either a c) (Either b c)

right' :: Cayley f p a b -> Cayley f p (Either c a) (Either c b)

mapCayley :: (forall a. f a -> g a) -> Cayley f p x y -> Cayley g p x y