|Copyright||(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2002|
|License||BSD-style (see the file libraries/base/LICENSE)|
For a detailed discussion, see Levent Erkok's thesis, Value Recursion in Monadic Computations, Oregon Graduate Institute, 2002.
Monads having fixed points with a 'knot-tying' semantics. Instances of
MonadFix should satisfy the following laws:
mfix (return . h) = return (fix h)
mfix (\x -> a >>= \y -> f x y) = a >>= \y -> mfix (\x -> f x y)
mfix (liftM h . f) = liftM h (mfix (f . h)), for strict
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.
fix f is the least fixed point of the function
f, i.e. the least defined
x such that
f x = x.
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).