Control.Monad.Resumption

A resumption monad transformer, based on the formulation in the article Cheap (But Functional) Threads by William L. Harrison and Adam Procter.

Documentation

newtype ResT m a

Resumption monad transformer.

Constructors

ResT

Fields

• deResT :: m (Either a (ResT m a))

Instances

MonadTrans ResT

Defined in Control.Monad.Resumption

Methods

lift :: Monad m => m a -> ResT m a

Monad m => Monad (ResT m)

Defined in Control.Monad.Resumption

Methods

(>>=) :: ResT m a -> (a -> ResT m b) -> ResT m b

(>>) :: ResT m a -> ResT m b -> ResT m b

return :: a -> ResT m a

fail :: String -> ResT m a

Monad m => Functor (ResT m)

Defined in Control.Monad.Resumption

Methods

fmap :: (a -> b) -> ResT m a -> ResT m b

(<$) :: a -> ResT m b -> ResT m a

Monad m => Applicative (ResT m)

Defined in Control.Monad.Resumption

Methods

pure :: a -> ResT m a

(<*>) :: ResT m (a -> b) -> ResT m a -> ResT m b

liftA2 :: (a -> b -> c) -> ResT m a -> ResT m b -> ResT m c

(*>) :: ResT m a -> ResT m b -> ResT m b

(<*) :: ResT m a -> ResT m b -> ResT m a

MonadIO m => MonadIO (ResT m)

Defined in Control.Monad.Resumption

Methods

liftIO :: IO a -> ResT m a

MFunctor ResT

Defined in Control.Monad.Resumption

Methods

hoist :: Monad m => (forall a. m a -> n a) -> ResT m b -> ResT n b

runResT :: Monad m => ResT m a -> m a

Runs a resumptive computation to exhaustion, producing its final return value.

tick :: Monad m => ResT m ()

Waits until the next tick.