Skip to content

Commit

Permalink
Merge pull request #134 from haskell/mlep/readme-updates-2.3.1
Browse files Browse the repository at this point in the history
Update readme for 2.3.1 updates
  • Loading branch information
emilypi authored Oct 31, 2022
2 parents 9c91d2a + 9d6feba commit 37cbd92
Showing 1 changed file with 23 additions and 0 deletions.
23 changes: 23 additions & 0 deletions README.markdown
Original file line number Diff line number Diff line change
Expand Up @@ -129,6 +129,29 @@ documentation on Hackage](https://hackage.haskell.org/package/mtl).
- Lazy transformers: `Control.Monad.Writer.Lazy.WriterT`
- Strict transformers: `Control.Monad.Writer.Strict.WriterT`

* `Control.Monad.Accum`

The `Accum` monad transformer represents a computation which
manages append-only state, or a writer that can read all
previous inputs. It binds a function to a monadic value by
lazily accumulating subcomputations via `(<>)`. For more general
access, use [State](https://hackage.haskell.org/package/transformers-0.6.0.4/docs/Control-Monad-Trans-State.html) instead.

- Class: `Control.Monad.Accum`
- Transformer: `Control.Monad.Trans.Accum.AccumT`

* `Control.Monad.Select`

The `Select` monad transformer represents a computation which
can do backtracking search using a 'ranked' evaluation strategy.
Binding a function to a monad value chains together evaluation
strategies in the sense that the results of previous strategies
may influence subsequent rank and evaluation strategies in
subcomputations.

- Class: `Control.Monad.Select`
- Transformer: `Control.Monad.Trans.Select.SelectT`

## Resources

* [`mtl` on Hackage](http://hackage.haskell.org/package/mtl)
Expand Down

0 comments on commit 37cbd92

Please sign in to comment.