Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Tools.Monoid

Documentation

monoid_power :: (Monoid m, Eq z, Num z) => m -> z -> m Source #

Constructors

Instances details

(Monoid a, Applicative f) => Monoid (Elementwise (f a)) Source #
Instance details Defined in Math.Tools.Monoid Methods mempty :: Elementwise (f a) # mappend :: Elementwise (f a) -> Elementwise (f a) -> Elementwise (f a) # mconcat :: [Elementwise (f a)] -> Elementwise (f a) #
(Semigroup a, Applicative f) => Semigroup (Elementwise (f a)) Source #
Instance details Defined in Math.Tools.Monoid Methods (<>) :: Elementwise (f a) -> Elementwise (f a) -> Elementwise (f a) # sconcat :: NonEmpty (Elementwise (f a)) -> Elementwise (f a) # stimes :: Integral b => b -> Elementwise (f a) -> Elementwise (f a) #

data MonoidT arr a b where Source #

Constructors

Mon :: arr a a -> MonoidT arr a a

Instances details

Category arr => Category (MonoidT arr :: Type -> Type -> Type) Source #
Instance details Defined in Math.Tools.Monoid Methods id :: forall (a :: k). MonoidT arr a a # (.) :: forall (b :: k) (c :: k) (a :: k). MonoidT arr b c -> MonoidT arr a b -> MonoidT arr a c #

data GroupT arr a b where Source #

Constructors

GroupT :: arr a a -> arr a a -> GroupT arr a a

Instances details

Category arr => Category (GroupT arr :: Type -> Type -> Type) Source #
Instance details Defined in Math.Tools.Monoid Methods id :: forall (a :: k). GroupT arr a a # (.) :: forall (b :: k) (c :: k) (a :: k). GroupT arr b c -> GroupT arr a b -> GroupT arr a c #
Category arr => Groupoid (GroupT arr :: Type -> Type -> Type) Source #
Instance details Defined in Math.Tools.Monoid Methods invertA :: forall (a :: k) (b :: k). GroupT arr a b -> GroupT arr b a Source #