| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Promonad.Free
Contents
Description
The free promonad on a profunctor, with base morphisms as pure arrows.
Synopsis
- data FreePromonad (p :: CAT k) (a :: k) (b :: k) where
- Unit :: forall {k} (a :: k) (b :: k) (p :: CAT k). (a ~> b) -> FreePromonad p a b
- Comp :: forall {k} (p :: CAT k) (a :: k) (b1 :: k) (b :: k). p a b1 -> FreePromonad p b1 b -> FreePromonad p a b
- liftFreePromonad :: forall {k} (p :: k +-> k). Profunctor p => p :~> FreePromonad p
- freePromonadAlg :: forall {k} (p :: k +-> k) (a :: k) (b :: k). (p :.: FreePromonad p) a b -> FreePromonad p a b
- foldFreePromonad :: forall {k1} (q :: CAT k1) (p :: k1 -> k1 -> Type). Promonad q => (p :~> q) -> FreePromonad p :~> q
Documentation
data FreePromonad (p :: CAT k) (a :: k) (b :: k) where Source Github #
A chain of ps ending in a base morphism, interpreted into any promonad
by foldFreePromonad.
Constructors
| Unit :: forall {k} (a :: k) (b :: k) (p :: CAT k). (a ~> b) -> FreePromonad p a b | |
| Comp :: forall {k} (p :: CAT k) (a :: k) (b1 :: k) (b :: k). p a b1 -> FreePromonad p b1 b -> FreePromonad p a b |
Instances
| Profunctor p => Profunctor (FreePromonad p :: j -> j -> Type) Source Github # | |
Defined in Proarrow.Promonad.Free Methods dimap :: forall (c :: j) (a :: j) (b :: j) (d :: j). (c ~> a) -> (b ~> d) -> FreePromonad p a b -> FreePromonad p c d Source Github # lmap :: forall (c :: j) (a :: j) (b :: j). (c ~> a) -> FreePromonad p a b -> FreePromonad p c b Source Github # rmap :: forall (b :: j) (d :: j) (a :: j). (b ~> d) -> FreePromonad p a b -> FreePromonad p a d Source Github # (\\) :: forall (a :: j) (b :: j) r. ((Ob a, Ob b) => r) -> FreePromonad p a b -> r Source Github # | |
| Profunctor p => Promonad (FreePromonad p :: k -> k -> Type) Source Github # | |
Defined in Proarrow.Promonad.Free Methods id :: forall (a :: k). Ob a => FreePromonad p a a Source Github # (.) :: forall (b :: k) (c :: k) (a :: k). FreePromonad p b c -> FreePromonad p a b -> FreePromonad p a c Source Github # | |
| Functor (FreePromonad :: CAT k -> k -> k -> Type) Source Github # | |
Defined in Proarrow.Promonad.Free Methods map :: forall (a :: CAT k) (b :: CAT k). (a ~> b) -> FreePromonad a ~> FreePromonad b Source Github # | |
| Promonad (Star (FreePromonad :: CAT k -> k -> k -> Type) :: (k -> k -> Type) -> CAT k -> Type) Source Github # | |
Defined in Proarrow.Promonad.Free Methods id :: forall (a :: k -> k -> Type). Ob a => Star (FreePromonad :: CAT k -> k -> k -> Type) a a Source Github # (.) :: forall (b :: k -> k -> Type) (c :: k -> k -> Type) (a :: k -> k -> Type). Star (FreePromonad :: CAT k -> k -> k -> Type) b c -> Star (FreePromonad :: CAT k -> k -> k -> Type) a b -> Star (FreePromonad :: CAT k -> k -> k -> Type) a c Source Github # | |
liftFreePromonad :: forall {k} (p :: k +-> k). Profunctor p => p :~> FreePromonad p Source Github #
Embed a generator as a one-step chain.
freePromonadAlg :: forall {k} (p :: k +-> k) (a :: k) (b :: k). (p :.: FreePromonad p) a b -> FreePromonad p a b Source Github #
foldFreePromonad :: forall {k1} (q :: CAT k1) (p :: k1 -> k1 -> Type). Promonad q => (p :~> q) -> FreePromonad p :~> q Source Github #