Safe Haskell	None
Language	GHC2024

Proarrow.Profunctor.Fold

Documentation

data Fold (a :: k) (b :: k) where Source Github #

Constructors

Fold :: forall {k} (m :: k) (b :: k) (a :: k). Ob m => (m ~> b) -> (a ~> m) -> ((m ** m) ~> m) -> ((Unit :: k) ~> m) -> Fold a b

Instances

Instances details

ProdAction k => Costrong k (Fold :: k -> k -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Methods

coact :: forall (a :: k) (x :: k) (y :: k). (Ob a, Ob x, Ob y) => Fold (Act a x) (Act a y) -> Fold x y Source Github #

SymMonoidal k => MonoidalProfunctor (Fold :: k -> k -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Methods

par0 :: Fold (Unit :: k) (Unit :: k) Source Github #

par :: forall (x1 :: k) (x2 :: k) (y1 :: k) (y2 :: k). Fold x1 x2 -> Fold y1 y2 -> Fold (x1 ** y1) (x2 ** y2) Source Github #

CategoryOf k => Profunctor (Fold :: k -> k -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Methods

dimap :: forall (c :: k) (a :: k) (b :: k) (d :: k). (c ~> a) -> (b ~> d) -> Fold a b -> Fold c d Source Github #

lmap :: forall (c :: k) (a :: k) (b :: k). (c ~> a) -> Fold a b -> Fold c b Source Github #

rmap :: forall (b :: k) (d :: k) (a :: k). (b ~> d) -> Fold a b -> Fold a d Source Github #

(\\) :: forall (a :: k) (b :: k) r. ((Ob a, Ob b) => r) -> Fold a b -> r Source Github #

Corepresentable (Fold :: Type -> Type -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Associated Types

type (Fold :: Type -> Type -> Type) %% (a :: Type)
Instance details Defined in Proarrow.Profunctor.Fold type (Fold :: Type -> Type -> Type) %% (a :: Type) = [a]

Methods

coindex :: Fold a b -> ((Fold :: Type -> Type -> Type) %% a) ~> b Source Github #

cotabulate :: Ob a => (((Fold :: Type -> Type -> Type) %% a) ~> b) -> Fold a b Source Github #

corepMap :: (a ~> b) -> ((Fold :: Type -> Type -> Type) %% a) ~> ((Fold :: Type -> Type -> Type) %% b) Source Github #

trivialCorep :: Ob a => Fold a ((Fold :: Type -> Type -> Type) %% a) Source Github #

(CoprodAction k, BiCCC k) => Strong (COPROD k) (Fold :: k -> k -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Methods

act :: forall (a :: COPROD k) (b :: COPROD k) (x :: k) (y :: k). (a ~> b) -> Fold x y -> Fold (Act a x) (Act b y) Source Github #

CategoryOf k => Procomonad (Fold :: k -> k -> Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

Methods

proextract :: (Fold :: k -> k -> Type) :~> ((~>) :: CAT k) Source Github #

produplicate :: (Fold :: k -> k -> Type) :~> ((Fold :: k -> k -> Type) :.: (Fold :: k -> k -> Type)) Source Github #

type (Fold :: Type -> Type -> Type) %% (a :: Type) Source Github #

Instance details

Defined in Proarrow.Profunctor.Fold

type (Fold :: Type -> Type -> Type) %% (a :: Type) = [a]

trav :: forall {j} {k} (f :: j -> k) (a :: j) (b :: j). Applicative f => Fold a b -> Fold (f a) (f b) Source Github #