| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Category.Instance.Monoid
Description
A monoid as a one-object category: the single object M, with the monoid's elements
as the morphisms. For a commutative monoid the tensor is the monoid operation
itself, making it symmetric monoidal, Unit ~> mClosed, StarAutonomous and CompactClosed, with a
cocommutative comonoid on M and hence CopyDiscard.
It is not cartesian or cocartesian: with one object, a terminal object needs a singleton
hom-set and binary products force , so both hold only for the trivial monoid.combine f g = f
Documentation
data MONOID (m :: k) Source Github #
Constructors
| M |
Instances
data Mon (a :: MONOID m) (b :: MONOID m1) where Source Github #
Constructors
| Mon :: forall {k} {k1} {m1 :: k1} (m :: k). ((Unit :: k) ~> m) -> Mon ('M :: MONOID m) ('M :: MONOID m1) |
Instances
| Monoid m => EnrichedProfunctor (Clone k) (Mon :: MONOID m -> MONOID m -> Type) Source Github # | A monoid is a one object enriched category. |
Defined in Proarrow.Category.Enriched Methods withProObj :: forall (a :: MONOID m) (b :: MONOID m) r. (Ob a, Ob b) => (Ob (ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a b) => r) -> r Source Github # underlying :: forall (a :: MONOID m) (b :: MONOID m). Mon a b -> (Unit :: Clone k) ~> ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a b Source Github # enriched :: forall (a :: MONOID m) (b :: MONOID m). (Ob a, Ob b) => ((Unit :: Clone k) ~> ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a b) -> Mon a b Source Github # rmap :: forall (a :: MONOID m) (b :: MONOID m) (c :: MONOID m). (Ob a, Ob b, Ob c) => (HomObj (Clone k) b c ** ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a b) ~> ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a c Source Github # lmap :: forall (a :: MONOID m) (b :: MONOID m) (c :: MONOID m). (Ob a, Ob b, Ob c) => (HomObj (Clone k) c a ** ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) a b) ~> ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) c b Source Github # | |
| CommutativeMonoid m => MonoidalProfunctor (Mon :: MONOID m -> MONOID m -> Type) Source Github # | |
| Monoid m => Profunctor (Mon :: MONOID m -> MONOID m -> Type) Source Github # | |
Defined in Proarrow.Category.Instance.Monoid Methods dimap :: forall (c :: MONOID m) (a :: MONOID m) (b :: MONOID m) (d :: MONOID m). (c ~> a) -> (b ~> d) -> Mon a b -> Mon c d Source Github # lmap :: forall (c :: MONOID m) (a :: MONOID m) (b :: MONOID m). (c ~> a) -> Mon a b -> Mon c b Source Github # rmap :: forall (b :: MONOID m) (d :: MONOID m) (a :: MONOID m). (b ~> d) -> Mon a b -> Mon a d Source Github # (\\) :: forall (a :: MONOID m) (b :: MONOID m) r. ((Ob a, Ob b) => r) -> Mon a b -> r Source Github # | |
| Monoid m => Promonad (Mon :: MONOID m -> MONOID m -> Type) Source Github # | |
| type ProObj (Clone k) (Mon :: MONOID m -> MONOID m -> Type) ('M :: MONOID m) ('M :: MONOID m) Source Github # | |