mtl-2.3.1: Monad classes for transformers, using functional dependencies
Copyright (C) Koz Ross 2022 Manuel Bärenz 2021 BSD-3-Clause (see the LICENSE file) koz.ross@retro-freedom.nz Experimental GHC only Trustworthy Haskell2010

Description

Computation type:
Accumulation (either append-only state, or writer with the ability to read all previous input).
Binding strategy:
Binding a function to a monadic value monoidally accumulates the subcomputations (that is, using <>).
Useful for:
Logging, patch-style tracking.
Zero and plus:
None.
Example type:
Accum w a

# A note on commutativity

Some effects are commutative: it doesn't matter which you resolve first, as all possible orderings of commutative effects are isomorphic. Consider, for example, the reader and state effects, as exemplified by ReaderT and StateT respectively. If we have ReaderT r (State s) a, this is effectively r -> State s a ~ r -> s -> (a, s); if we instead have StateT s (Reader r) a, this is effectively s -> Reader r (a, s) ~ s -> r -> (a, s). Since we can always reorder function arguments (for example, using flip, as in this case) without changing the result, these are isomorphic, showing that reader and state are commutative, or, more precisely, commute with each other.

However, this isn't generally the case. Consider instead the error and state effects, as exemplified by MaybeT and StateT respectively. If we have MaybeT (State s) a, this is effectively State s (Maybe a) ~ s -> (Maybe a, s): put simply, the error can occur only in the result, but not the state, which always 'survives'. On the other hand, if we have StateT s Maybe a, this is instead s -> Maybe (a, s): here, if we error, we lose both the state and the result! Thus, error and state effects do not commute with each other.

As the MTL is capability-based, we support any ordering of non-commutative effects on an equal footing. Indeed, if you wish to use MonadState, for example, whether your final monadic stack ends up being MaybeT (State s) a, StateT s Maybe a, or anything else, you will be able to write your desired code without having to consider such differences. However, the way we implement these capabilities for any given transformer (or rather, any given transformed stack) is affected by this ordering unless the effects in question are commutative.

We note in this module which effects the accumulation effect does and doesn't commute with; we also note on implementations with non-commutative transformers what the outcome will be. Note that, depending on how the 'inner monad' is structured, this may be more complex than we note: we describe only what impact the 'outer effect' has, not what else might be in the stack.

# Commutativity of accumulation

The accumulation effect commutes with the identity effect (IdentityT), reader, writer or state effects (ReaderT, WriterT, StateT and any combination, including RWST for example) and with itself. It does not commute with anything else.

Synopsis

# Type class

class (Monoid w, Monad m) => MonadAccum w m | m -> w where Source #

The capability to accumulate. This can be seen in one of two ways:

• A MonadState which can only append (using <>); or
• A MonadWriter (limited to tell) with the ability to view the result of all previous tells.

# Laws

accum should obey the following:

1. accum (const (x, mempty)) = pure x
2. accum f *> accum g = accum $acc -> let (_, v) = f acc (res, w) = g (acc <> v) in (res, v <> w) If you choose to define look and add instead, their definitions must obey the following: 1. look *> look = look 2. add mempty = pure () 3. add x *> add y = add (x <> y) 4. add x *> look = look >>= w -> add x$> w <> x

If you want to define both, the relationship between them is as follows. These are also the default definitions.

1. look = accum $acc -> (acc, mempty) 2. add x = accum$ acc -> ((), x)

# Other functions

looks :: forall (a :: Type) (m :: Type -> Type) (w :: Type). MonadAccum w m => (w -> a) -> m a Source #

Retrieve a function of the accumulated value.

Since: mtl-2.3