monoid-transformer-0.0.4.1: Monoid counterparts to some ubiquitous monad transformers
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Monoid.Monad

Synopsis
  • newtype T (m :: Type -> Type) a = Cons {}

Documentation

newtype T (m :: Type -> Type) a Source #

Sequence actions and combine their monadic results with (<>).

This type could be omitted, if Monad would be a sub-class of Applicative.

Constructors

Cons 

Fields

Instances

Instances details
Monad m => C (T m) Source # 
Instance details

Defined in Data.Monoid.Monad

Methods

lift :: Monoid m0 => m0 -> T m m0 Source #

(Monad m, Monoid a) => Monoid (T m a) Source # 
Instance details

Defined in Data.Monoid.Monad

Methods

mempty :: T m a

mappend :: T m a -> T m a -> T m a

mconcat :: [T m a] -> T m a

(Monad m, Semigroup a) => Semigroup (T m a) Source # 
Instance details

Defined in Data.Monoid.Monad

Methods

(<>) :: T m a -> T m a -> T m a

sconcat :: NonEmpty (T m a) -> T m a

stimes :: Integral b => b -> T m a -> T m a