Package0.6.3.0Control

transformers

Concrete functor and monad transformers

Version0.6.3.0
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.3.0

Modules

Control.Applicative.BackwardsMaking functors with an Applicative instance that performs actions
Control.Applicative.LiftAdding a new kind of pure computation to an applicative functor.
Control.Monad.SignaturesSignatures for monad operations that require specialized lifting.
Control.Monad.Trans.AccumThe lazy AccumT monad transformer, which adds accumulation
Control.Monad.Trans.ClassThe class of monad transformers. A monad transformer makes a new monad out of an existing monad, such
Control.Monad.Trans.ContContinuation monads. Delimited continuation operators are taken from Kenichi Asai and Oleg
Control.Monad.Trans.ExceptThis monad transformer extends a monad with the ability to throw
Control.Monad.Trans.IdentityThe identity monad transformer. This is useful for functions parameterized by a monad transformer.
Control.Monad.Trans.MaybeThe MaybeT monad transformer extends a monad with the ability to exit
Control.Monad.Trans.RWSA monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.CPSA monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.LazyA monad transformer that combines ReaderT,
Control.Monad.Trans.RWS.StrictA monad transformer that combines ReaderT,
Control.Monad.Trans.ReaderDeclaration of the ReaderT monad transformer, which adds a static
Control.Monad.Trans.SelectSelection monad transformer, modelling search algorithms. Martin Escardo and Paulo Oliva.
Control.Monad.Trans.StateState monads, passing an updatable state through a computation. Some computations may not require the full power of state transformers: F…
Control.Monad.Trans.State.LazyLazy state monads, passing an updatable state through a computation.
Control.Monad.Trans.State.StrictStrict state monads, passing an updatable state through a computation.
Control.Monad.Trans.WriterThe WriterT monad transformer.
Control.Monad.Trans.Writer.CPSThe strict WriterT monad transformer, which adds collection of
Control.Monad.Trans.Writer.LazyThe lazy WriterT monad transformer, which adds collection of
Control.Monad.Trans.Writer.StrictThe strict WriterT monad transformer, which adds collection of
Data.Functor.ConstantThe constant functor.
Data.Functor.ReverseMaking 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.23.0.0with GHC

Modules

Description

Depends on

Used by in this set · 80