Data.Profunctor.Composition.List

Documentation

data PList (ps :: [* -> * -> *]) (a :: *) (b :: *) where

N-ary composition of profunctors.

Constructors

Hom

Fields

• :: { unHom :: a -> b
•    } -> PList '[] a b

P

Fields

• :: { unP :: p a b
•    } -> PList '[p] a b

PComp :: p a x -> PList (q ': qs) x b -> PList (p ': (q ': qs)) a b

Instances

(Profunctor p, Profunctor (PList (q ': qs))) => Profunctor (PList (p ': (q ': qs)))

Defined in Data.Profunctor.Composition.List

Methods

dimap :: (a -> b) -> (c -> d) -> PList (p ': (q ': qs)) b c -> PList (p ': (q ': qs)) a d

lmap :: (a -> b) -> PList (p ': (q ': qs)) b c -> PList (p ': (q ': qs)) a c

rmap :: (b -> c) -> PList (p ': (q ': qs)) a b -> PList (p ': (q ': qs)) a c

(#.) :: Coercible c b => q0 b c -> PList (p ': (q ': qs)) a b -> PList (p ': (q ': qs)) a c

(.#) :: Coercible b a => PList (p ': (q ': qs)) b c -> q0 a b -> PList (p ': (q ': qs)) a c

Profunctor p => Profunctor (PList (p ': ([] :: [Type -> Type -> Type])))

Defined in Data.Profunctor.Composition.List

Methods

dimap :: (a -> b) -> (c -> d) -> PList (p ': []) b c -> PList (p ': []) a d

lmap :: (a -> b) -> PList (p ': []) b c -> PList (p ': []) a c

rmap :: (b -> c) -> PList (p ': []) a b -> PList (p ': []) a c

(#.) :: Coercible c b => q b c -> PList (p ': []) a b -> PList (p ': []) a c

(.#) :: Coercible b a => PList (p ': []) b c -> q a b -> PList (p ': []) a c

Profunctor (PList ([] :: [Type -> Type -> Type]))

Defined in Data.Profunctor.Composition.List

Methods

dimap :: (a -> b) -> (c -> d) -> PList [] b c -> PList [] a d

lmap :: (a -> b) -> PList [] b c -> PList [] a c

rmap :: (b -> c) -> PList [] a b -> PList [] a c

(#.) :: Coercible c b => q b c -> PList [] a b -> PList [] a c

(.#) :: Coercible b a => PList [] b c -> q a b -> PList [] a c

type family PlainP (ps :: [* -> * -> *]) :: * -> * -> *

Calculate the simplified type of the composition of a list of profunctors.

Instances

type PlainP ([] :: [Type -> Type -> Type])

Defined in Data.Profunctor.Composition.List

type PlainP ([] :: [Type -> Type -> Type]) = ((->) :: Type -> Type -> Type)

type PlainP (p ': (q ': qs))

Defined in Data.Profunctor.Composition.List

type PlainP (p ': (q ': qs)) = Procompose (PlainP (q ': qs)) p

type PlainP (p ': ([] :: [Type -> Type -> Type]))

Defined in Data.Profunctor.Composition.List

type PlainP (p ': ([] :: [Type -> Type -> Type])) = p

class IsPList ps where

Functions for working with PLists.

Methods

pappend :: Profunctor (PList qs) => Procompose (PList qs) (PList ps) :-> PList (ps ++ qs)

Combine 2 nested PLists into one PList.

punappend :: PList (ps ++ qs) :-> Procompose (PList qs) (PList ps)

Split one PList into 2 nested PLists.

toPlainP :: PList ps :-> PlainP ps

Convert a PList to its simplified form.

fromPlainP :: PlainP ps :-> PList ps

Create a PList from its simplified form.

Instances

IsPList ([] :: [Type -> Type -> Type])

Defined in Data.Profunctor.Composition.List

Methods

pappend :: Profunctor (PList qs) => Procompose (PList qs) (PList []) :-> PList ([] ++ qs)

punappend :: PList ([] ++ qs) :-> Procompose (PList qs) (PList [])

toPlainP :: PList [] :-> PlainP []

fromPlainP :: PlainP [] :-> PList []

IsPList (q ': qs) => IsPList (p ': (q ': qs))

Defined in Data.Profunctor.Composition.List

Methods

pappend :: Profunctor (PList qs0) => Procompose (PList qs0) (PList (p ': (q ': qs))) :-> PList ((p ': (q ': qs)) ++ qs0)

punappend :: PList ((p ': (q ': qs)) ++ qs0) :-> Procompose (PList qs0) (PList (p ': (q ': qs)))

toPlainP :: PList (p ': (q ': qs)) :-> PlainP (p ': (q ': qs))

fromPlainP :: PlainP (p ': (q ': qs)) :-> PList (p ': (q ': qs))

Profunctor p => IsPList (p ': ([] :: [Type -> Type -> Type]))

Defined in Data.Profunctor.Composition.List

Methods

pappend :: Profunctor (PList qs) => Procompose (PList qs) (PList (p ': [])) :-> PList ((p ': []) ++ qs)

punappend :: PList ((p ': []) ++ qs) :-> Procompose (PList qs) (PList (p ': []))

toPlainP :: PList (p ': []) :-> PlainP (p ': [])

fromPlainP :: PlainP (p ': []) :-> PList (p ': [])