Copyright | (c) Ross Paterson 2017 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | R.Paterson@city.ac.uk |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Selection monad transformer, modelling search algorithms.
- Martin Escardo and Paulo Oliva. "Selection functions, bar recursion and backward induction", Mathematical Structures in Computer Science 20:2 (2010), pp. 127-168. https://www.cs.bham.ac.uk/~mhe/papers/selection-escardo-oliva.pdf
- Jules Hedges. "Monad transformers for backtracking search". In Proceedings of MSFP 2014. https://arxiv.org/abs/1406.2058
The Select monad
select :: ((a -> r) -> a) -> Select r a Source #
Constructor for computations in the selection monad.
runSelect :: Select r a -> (a -> r) -> a Source #
Runs a Select
computation with a function for evaluating answers
to select a particular answer. (The inverse of select
.)
The SelectT monad transformer
newtype SelectT r m a Source #
Selection monad transformer.
SelectT
is not a functor on the category of monads, and many operations
cannot be lifted through it.
SelectT ((a -> m r) -> m a) |
MonadTrans (SelectT r) Source # | |
Monad m => Monad (SelectT r m) Source # | |
Functor m => Functor (SelectT r m) Source # | |
MonadFail m => MonadFail (SelectT r m) Source # | |
(Functor m, Monad m) => Applicative (SelectT r m) Source # | |
MonadIO m => MonadIO (SelectT r m) Source # | |
(Functor m, MonadPlus m) => Alternative (SelectT r m) Source # | |
MonadPlus m => MonadPlus (SelectT r m) Source # | |
runSelectT :: SelectT r m a -> (a -> m r) -> m a Source #
Runs a SelectT
computation with a function for evaluating answers
to select a particular answer. (The inverse of select
.)