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

Data.Monoid.Applicative

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

Documentation

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

Sequence applicative functors and combine their functorial results with (<>).

Constructors

Cons 

Fields

Instances

Instances details
Applicative f => C (T f) Source # 
Instance details

Defined in Data.Monoid.Applicative

Methods

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

(Applicative f, Monoid a) => Monoid (T f a) Source # 
Instance details

Defined in Data.Monoid.Applicative

Methods

mempty :: T f a

mappend :: T f a -> T f a -> T f a

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

(Applicative f, Semigroup a) => Semigroup (T f a) Source # 
Instance details

Defined in Data.Monoid.Applicative

Methods

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

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

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