--- For more details, see Levent Erkok's thesis,
--- /Value Recursion in Monadic Computations/, 2002.
+-- 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 laws
+-- | Monads having fixed points with a \'knot-tying\' semantics.
+-- Instances of 'MonadFix' should satisfy the following laws:
--- [left shrinking (or tightening)]
--- @'mfix' (\x -> a >>= \y -> f x y) = \y -> 'mfix' (\x -> f x y)@
+-- [/left shrinking/ (or /tightening/)]
+-- @'mfix' (\\x -> a >>= \\y -> f x y) = \\y -> 'mfix' (\\x -> f x y)@
--
-- This class is used in the translation of the recursive @do@ notation
-- supported by GHC and Hugs.
class (Monad m) => MonadFix m where
-- | The fixed point of a monadic computation.
--
-- This class is used in the translation of the recursive @do@ notation
-- supported by GHC and Hugs.
class (Monad m) => MonadFix m where
-- | The fixed point of a monadic computation.
-- output fed back as the input. Hence @f@ should not be strict,
-- for then @'mfix' f@ would diverge.
mfix :: (a -> m a) -> m a
-- output fed back as the input. Hence @f@ should not be strict,
-- for then @'mfix' f@ would diverge.
mfix :: (a -> m a) -> m a