Package0.6.1.1Control

transformers

Concrete functor and monad transformers

Version0.6.1.1
CategoryControl
LicenceBSD-3-Clause
AuthorAndy Gill, Ross Paterson
MaintainerRoss Paterson <R.Paterson@city.ac.uk>
Pinned bywith GHC
Sourcehackage.haskell.org/package/transformers-0.6.1.1

Modules

24 modules

Control.Applicative.Backwards1Making functors with an Applicative instance that performs actions
Control.Applicative.Lift8Adding a new kind of pure computation to an applicative functor.
Control.Monad.Signatures4Signatures for monad operations that require specialized lifting.
Control.Monad.Trans.Accum22The lazy AccumT monad transformer, which adds accumulation
Control.Monad.Trans.Class1The class of monad transformers. A monad transformer makes a new monad out of an existing monad, such
Control.Monad.Trans.Cont16Continuation monads. Delimited continuation operators are taken from Kenichi Asai and Oleg
Control.Monad.Trans.Except17This monad transformer extends a monad with the ability to throw exceptions. A sequence of actions terminates normally, producing a value,
Control.Monad.Trans.Identity4The identity monad transformer. This is useful for functions parameterized by a monad transformer.
Control.Monad.Trans.Maybe9The MaybeT monad transformer extends a monad with the ability to exit
Control.Monad.Trans.RWS0A monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.CPS32A monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.Lazy30A monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.Strict30A monad transformer that combines ReaderT,
Control.Monad.Trans.Reader13Declaration of the ReaderT monad transformer, which adds a static
Control.Monad.Trans.Select8Selection monad transformer, modelling search algorithms. Martin Escardo and Paulo Oliva.
Control.Monad.Trans.State0State monads, passing an updatable state through a computation. Some computations may not require the full power of state transformers: F…
Control.Monad.Trans.State.Lazy23Lazy state monads, passing an updatable state through a computation.
Control.Monad.Trans.State.Strict23Strict state monads, passing an updatable state through a computation.
Control.Monad.Trans.Writer0The WriterT monad transformer.
Control.Monad.Trans.Writer.CPS17The strict WriterT monad transformer, which adds collection of
Control.Monad.Trans.Writer.Lazy15The lazy WriterT monad transformer, which adds collection of
Control.Monad.Trans.Writer.Strict15The strict WriterT monad transformer, which adds collection of
Data.Functor.Constant1The constant functor.
Data.Functor.Reverse1Making functors whose elements are notionally in the reverse order

Description

A portable library of functor and monad transformers, inspired by the paper

"Functional Programming with Overloading and Higher-Order Polymorphism", by Mark P Jones, in Advanced School of Functional Programming, 1995 (http://web.cecs.pdx.edu/~mpj/pubs/springschool.html).

This package contains:

the monad transformer class (in Control.Monad.Trans.Class) concrete functor and monad transformers, each with associated operations and functions to lift operations associated with other transformers.

The package can be used on its own in portable Haskell code, in which case operations need to be manually lifted through transformer stacks (see Control.Monad.Trans.Class for some examples). Alternatively, it can be used with the non-portable monad classes in the mtl or monads-tf packages, which automatically lift operations introduced by monad transformers through other transformers.

Depends on

1 package

base-4.20.2.0with GHC

Modules

Description

Depends on

Used by in this set · 252