Safe Haskell	Safe
Language	Haskell2010

Data.Profunctor.Arrow

Synopsis

arr :: Category p => Profunctor p => (a -> b) -> p a b
ex1 :: Category p => Profunctor p => p (a, b) b
ex2 :: Category p => Profunctor p => p (a, b) a
inl :: Category p => Profunctor p => p a (a + b)
inr :: Category p => Profunctor p => p b (a + b)
braid :: Category p => Profunctor p => p (a, b) (b, a)
ebraid :: Category p => Profunctor p => p (a + b) (b + a)
loop :: Costrong p => p (a, d) (b, d) -> p a b
left :: Choice p => p a b -> p (a + c) (b + c)
right :: Choice p => p a b -> p (c + a) (c + b)
first :: Strong p => p a b -> p (a, c) (b, c)
second :: Strong p => p a b -> p (c, a) (c, b)
returnA :: Category p => Profunctor p => p a a
(***) :: Category p => Strong p => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2)
(+++) :: Category p => Choice p => p a1 b1 -> p a2 b2 -> p (a1 + a2) (b1 + b2)
(&&&) :: Category p => Strong p => p a b1 -> p a b2 -> p a (b1, b2)
(|||) :: Category p => Choice p => p a1 b -> p a2 b -> p (a1 + a2) b
($$$) :: Category p => Strong p => p a (b -> c) -> p a b -> p a c
adivide :: Category p => Strong p => (a -> (a1, a2)) -> p a1 b -> p a2 b -> p a b
adivide' :: Category p => Strong p => p a b -> p a b -> p a b
adivided :: Category p => Strong p => p a1 b -> p a2 b -> p (a1, a2) b
aselect :: Category p => Choice p => ((b1 + b2) -> b) -> p a b1 -> p a b2 -> p a b
aselect' :: Category p => Choice p => p a b -> p a b -> p a b
aselected :: Category p => Choice p => p a b1 -> p a b2 -> p a (b1 + b2)

Documentation

arr :: Category p => Profunctor p => (a -> b) -> p a b Source #

Lift a function into a profunctor arrow.

Usable w arrow syntax w the Arrows & RebindableSyntax extensions.

(a >>> b) >>> c = a >>> (b >>> c)
arr f >>> a = dimap f id a
a >>> arr f = dimap id f a
arr (g . f) = arr f >>> arr g

braid :: Category p => Profunctor p => p (a, b) (b, a) Source #

loop :: Costrong p => p (a, d) (b, d) -> p a b Source #

left :: Choice p => p a b -> p (a + c) (b + c) Source #

right :: Choice p => p a b -> p (c + a) (c + b) Source #

first :: Strong p => p a b -> p (a, c) (b, c) Source #

second :: Strong p => p a b -> p (c, a) (c, b) Source #

(***) :: Category p => Strong p => p a1 b1 -> p a2 b2 -> p (a1, a2) (b1, b2) infixr 3 Source #

(+++) :: Category p => Choice p => p a1 b1 -> p a2 b2 -> p (a1 + a2) (b1 + b2) infixr 2 Source #

(&&&) :: Category p => Strong p => p a b1 -> p a b2 -> p a (b1, b2) infixr 3 Source #

(|||) :: Category p => Choice p => p a1 b -> p a2 b -> p (a1 + a2) b infixr 2 Source #

($$$) :: Category p => Strong p => p a (b -> c) -> p a b -> p a c infixr 0 Source #

adivide :: Category p => Strong p => (a -> (a1, a2)) -> p a1 b -> p a2 b -> p a b Source #

adivide' :: Category p => Strong p => p a b -> p a b -> p a b Source #

adivided :: Category p => Strong p => p a1 b -> p a2 b -> p (a1, a2) b Source #

aselect :: Category p => Choice p => ((b1 + b2) -> b) -> p a b1 -> p a b2 -> p a b Source #

aselect' :: Category p => Choice p => p a b -> p a b -> p a b Source #

aselected :: Category p => Choice p => p a b1 -> p a b2 -> p a (b1 + b2) Source #