profunctors-5.2: Profunctors

Copyright(C) 2014-2015 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityexperimental
Portabilityportable
Safe HaskellNone
LanguageHaskell2010

Data.Profunctor.Closed

Description

 

Synopsis

Documentation

class Profunctor p => Closed p where Source #

A strong profunctor allows the monoidal structure to pass through.

A closed profunctor allows the closed structure to pass through.

Minimal complete definition

closed

Methods

closed :: p a b -> p (x -> a) (x -> b) Source #

Instances

Closed (->) Source # 

Methods

closed :: (a -> b) -> (x -> a) -> x -> b Source #

(Distributive f, Monad f) => Closed (Kleisli f) Source # 

Methods

closed :: Kleisli f a b -> Kleisli f (x -> a) (x -> b) Source #

Functor f => Closed (Cokleisli f) Source # 

Methods

closed :: Cokleisli f a b -> Cokleisli f (x -> a) (x -> b) Source #

Closed (Tagged *) Source # 

Methods

closed :: Tagged * a b -> Tagged * (x -> a) (x -> b) Source #

Functor f => Closed (Costar f) Source # 

Methods

closed :: Costar f a b -> Costar f (x -> a) (x -> b) Source #

Distributive f => Closed (Star f) Source # 

Methods

closed :: Star f a b -> Star f (x -> a) (x -> b) Source #

Closed (Environment p) Source # 

Methods

closed :: Environment p a b -> Environment p (x -> a) (x -> b) Source #

Profunctor p => Closed (Closure p) Source # 

Methods

closed :: Closure p a b -> Closure p (x -> a) (x -> b) Source #

Closed (FreeMapping p) Source # 

Methods

closed :: FreeMapping p a b -> FreeMapping p (x -> a) (x -> b) Source #

Profunctor p => Closed (CofreeMapping p) Source # 

Methods

closed :: CofreeMapping p a b -> CofreeMapping p (x -> a) (x -> b) Source #

(Closed p, Closed q) => Closed (Procompose p q) Source # 

Methods

closed :: Procompose p q a b -> Procompose p q (x -> a) (x -> b) Source #

(Closed p, Closed q) => Closed (Product * * p q) Source # 

Methods

closed :: Product * * p q a b -> Product * * p q (x -> a) (x -> b) Source #

(Functor f, Closed p) => Closed (Tannen * * * f p) Source # 

Methods

closed :: Tannen * * * f p a b -> Tannen * * * f p (x -> a) (x -> b) Source #

newtype Closure p a b Source #

Closure adjoins a Closed structure to any Profunctor.

Analogous to Tambara for Strong.

Constructors

Closure 

Fields

Instances

ProfunctorComonad Closure Source # 
ProfunctorFunctor Closure Source # 

Methods

promap :: Profunctor p => (p :-> q) -> Closure p :-> Closure q Source #

ProfunctorAdjunction Environment Closure Source # 
Arrow p => Arrow (Closure p) Source # 

Methods

arr :: (b -> c) -> Closure p b c #

first :: Closure p b c -> Closure p (b, d) (c, d) #

second :: Closure p b c -> Closure p (d, b) (d, c) #

(***) :: Closure p b c -> Closure p b' c' -> Closure p (b, b') (c, c') #

(&&&) :: Closure p b c -> Closure p b c' -> Closure p b (c, c') #

ArrowZero p => ArrowZero (Closure p) Source # 

Methods

zeroArrow :: Closure p b c #

ArrowPlus p => ArrowPlus (Closure p) Source # 

Methods

(<+>) :: Closure p b c -> Closure p b c -> Closure p b c #

ArrowLoop p => ArrowLoop (Closure p) Source # 

Methods

loop :: Closure p (b, d) (c, d) -> Closure p b c #

Profunctor p => Profunctor (Closure p) Source # 

Methods

dimap :: (a -> b) -> (c -> d) -> Closure p b c -> Closure p a d Source #

lmap :: (a -> b) -> Closure p b c -> Closure p a c Source #

rmap :: (b -> c) -> Closure p a b -> Closure p a c Source #

(#.) :: Coercible * c b => (b -> c) -> Closure p a b -> Closure p a c Source #

(.#) :: Coercible * b a => Closure p b c -> (a -> b) -> Closure p a c Source #

Strong p => Strong (Closure p) Source # 

Methods

first' :: Closure p a b -> Closure p (a, c) (b, c) Source #

second' :: Closure p a b -> Closure p (c, a) (c, b) Source #

Profunctor p => Closed (Closure p) Source # 

Methods

closed :: Closure p a b -> Closure p (x -> a) (x -> b) Source #

Category * p => Category * (Closure p) Source # 

Methods

id :: cat a a #

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

Profunctor p => Functor (Closure p a) Source # 

Methods

fmap :: (a -> b) -> Closure p a a -> Closure p a b #

(<$) :: a -> Closure p a b -> Closure p a a #

(Profunctor p, Arrow p) => Applicative (Closure p a) Source # 

Methods

pure :: a -> Closure p a a #

(<*>) :: Closure p a (a -> b) -> Closure p a a -> Closure p a b #

(*>) :: Closure p a a -> Closure p a b -> Closure p a b #

(<*) :: Closure p a a -> Closure p a b -> Closure p a a #

(Profunctor p, ArrowPlus p) => Alternative (Closure p a) Source # 

Methods

empty :: Closure p a a #

(<|>) :: Closure p a a -> Closure p a a -> Closure p a a #

some :: Closure p a a -> Closure p a [a] #

many :: Closure p a a -> Closure p a [a] #

(Profunctor p, Arrow p, Monoid b) => Monoid (Closure p a b) Source # 

Methods

mempty :: Closure p a b #

mappend :: Closure p a b -> Closure p a b -> Closure p a b #

mconcat :: [Closure p a b] -> Closure p a b #

close :: Closed p => (p :-> q) -> p :-> Closure q Source #

data Environment p a b where Source #

Constructors

Environment :: ((z -> y) -> b) -> p x y -> (a -> z -> x) -> Environment p a b 

Instances

ProfunctorMonad Environment Source # 
ProfunctorFunctor Environment Source # 

Methods

promap :: Profunctor p => (p :-> q) -> Environment p :-> Environment q Source #

ProfunctorAdjunction Environment Closure Source # 
Profunctor (Environment p) Source # 

Methods

dimap :: (a -> b) -> (c -> d) -> Environment p b c -> Environment p a d Source #

lmap :: (a -> b) -> Environment p b c -> Environment p a c Source #

rmap :: (b -> c) -> Environment p a b -> Environment p a c Source #

(#.) :: Coercible * c b => (b -> c) -> Environment p a b -> Environment p a c Source #

(.#) :: Coercible * b a => Environment p b c -> (a -> b) -> Environment p a c Source #

Closed (Environment p) Source # 

Methods

closed :: Environment p a b -> Environment p (x -> a) (x -> b) Source #

curry' :: Closed p => p (a, b) c -> p a (b -> c) Source #