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.
MonadFix should satisfy the following laws:
return. h) =
- left shrinking (or tightening)
mfix(\x -> a >>= \y -> f x y) = a >>= \y ->
mfix(\x -> f x y)
, for strict
Control.Monad.liftMh . f) =
mfix(f . h))
mfix(\y -> f x y)) =
mfix(\x -> f x x)
This class is used in the translation of the recursive
supported by GHC and Hugs.