transformers

Concrete functor and monad transformers

Version on this page:	0.5.6.2
LTS Haskell 23.5:	0.6.1.0
Stackage Nightly 2025-01-21:	0.6.1.1
Latest on Hackage:	0.6.1.2

See all snapshots transformers appears in

BSD-3-Clause licensed by Andy Gill, Ross Paterson

Maintained by Ross Paterson

This version can be pinned in stack with:transformers-0.5.6.2@sha256:6c959d14430f4deffb99579ba019de07c3d852a2122b6f449344386c7d75ff1d,3172

Module documentation for 0.5.6.2

Depends on 1 package(full list with versions):

base

Used by 638 packages in lts-14.27(full list with versions):

ad, adjunctions, aeson-better-errors, Allure, alsa-seq, alternators, ALUT, apply-refact, arithmoi, asif, attoparsec, audacity, authenticate, authenticate-oauth, auto, avers-server, backprop, basic-prelude, bench-show, bifunctors, binary-ext, binary-list, binary-orphans, binary-parser, binary-search, bits, blas-carray, blas-comfort-array, board-games, boltzmann-samplers, boring, bound, bower-json, brick, brittany, butcher, butter, bytes, Cabal, cabal2nix, and many more

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.