base-4.8.1.0: Basic libraries

Description

For a detailed discussion, see Levent Erkok's thesis, Value Recursion in Monadic Computations, Oregon Graduate Institute, 2002.

Synopsis

# Documentation

Monads having fixed points with a 'knot-tying' semantics. Instances of `MonadFix` should satisfy the following laws:

purity
`mfix (return . h) = return (fix h)`
left shrinking (or tightening)
`mfix (\x -> a >>= \y -> f x y) = a >>= \y -> mfix (\x -> f x y)`
sliding
`mfix (liftM h . f) = liftM h (mfix (f . h))`, for strict `h`.
nesting
`mfix (\x -> mfix (\y -> f x y)) = mfix (\x -> f x x)`

This class is used in the translation of the recursive `do` notation supported by GHC and Hugs.

Methods

mfix :: (a -> m a) -> m a Source

The fixed point of a monadic computation. `mfix f` executes the action `f` only once, with the eventual output fed back as the input. Hence `f` should not be strict, for then `mfix f` would diverge.

Instances

 MonadFix [] Source Methodsmfix :: (a -> [a]) -> [a] Source Source Methodsmfix :: (a -> IO a) -> IO a Source Source Methodsmfix :: (a -> Maybe a) -> Maybe a Source Source Methodsmfix :: (a -> Identity a) -> Identity a Source MonadFix ((->) r) Source Methodsmfix :: (a -> (->) r a) -> (->) r a Source Source Methodsmfix :: (a -> Either e a) -> Either e a Source MonadFix (ST s) Source Methodsmfix :: (a -> ST s a) -> ST s a Source MonadFix (ST s) Source Methodsmfix :: (a -> ST s a) -> ST s a Source

fix :: (a -> a) -> a Source

`fix f` is the least fixed point of the function `f`, i.e. the least defined `x` such that `f x = x`.