transformers-0.3.0.0: Concrete functor and monad transformers

Copyright(c) Ross Paterson 2010
LicenseBSD-style (see the file LICENSE)
Maintainerross@soi.city.ac.uk
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Control.Applicative.Lift

Contents

Description

Adding a new kind of pure computation to an applicative functor.

Synopsis

Documentation

data Lift f aSource

Applicative functor formed by adding pure computations to a given applicative functor.

Constructors

Pure a 
Other (f a) 

Instances

Alternative f => Alternative (Lift f)

A combination is Pure only either part is.

Functor f => Functor (Lift f) 
Applicative f => Applicative (Lift f)

A combination is Pure only if both parts are.

Foldable f => Foldable (Lift f) 
Traversable f => Traversable (Lift f) 

unLift :: Applicative f => Lift f a -> f aSource

Projection to the other functor.

Collecting errors

type Errors e = Lift (Constant e)Source

An applicative functor that collects a monoid (e.g. lists) of errors. A sequence of computations fails if any of its components do, but unlike monads made with ErrorT from Control.Monad.Trans.Error, these computations continue after an error, collecting all the errors.

failure :: Monoid e => e -> Errors e aSource

Report an error.