From e982249359ca541e85a55cff28d98b656e487e51 Mon Sep 17 00:00:00 2001
From: erkok <unknown>
Date: Sat, 28 Sep 2002 00:29:32 +0000
Subject: [PATCH] [project @ 2002-09-28 00:29:32 by erkok] documentation for
 the mdo-notation.

(I've run this through jade, no syntax errors, but couldn't get
any html output as my docbook installation is a bit weird: couldn't
find style-files etc. it'll be great if someone can run it through
to make sure what I added looks acceptable..)
---
 ghc/docs/users_guide/glasgow_exts.sgml |   68 ++++++++++++++++++++++++++++++++
 1 file changed, 68 insertions(+)

diff --git a/ghc/docs/users_guide/glasgow_exts.sgml b/ghc/docs/users_guide/glasgow_exts.sgml
index a780c37..bcc7d1e 100644
--- a/ghc/docs/users_guide/glasgow_exts.sgml
+++ b/ghc/docs/users_guide/glasgow_exts.sgml
@@ -4024,6 +4024,74 @@ classes usually have one "main" parameter for which deriving new
 instances is most interesting.
 </para>
 </sect2>
+
+<sect2 id="mdo-notation">
+<title>The recursive do-notation
+</title>
+
+<para> The recursive do-notation (a.k.a. mdo-notation) is implemented as described in
+"A recursive do for Haskell",
+Levent Erkok, John Launchbury",
+Haskell Workshop 2002, pages: 29-37. Pittsburgh, Pennsylvania. 
+</para>
+<para>
+The do-notation of Haskell does not allow <emphasis>recursive bindings</emphasis>,
+that is, the variables bound in a do-expression are visible only in the textually following 
+code block. Compare this to a let-expression, where bound variables are visible in the entire binding
+group. It turns out that several applications can benefit from recursive bindings in
+the do-notation, and this extension provides the necessary syntactic support.
+</para>
+<para>
+Here is a simple (yet contrived) example:
+</para>
+<programlisting>
+import Control.Monad.MonadRec
+
+justOnes = mdo xs <- Just (1:xs)
+               return xs
+</programlisting>
+<para>
+There are three important points in using the recursive-do notation:
+<itemizedlist>
+<listitem><para>
+The recursive version of the do-notation uses the keyword <literal>mdo</literal> (rather
+than <literal>do</literal>).
+</para></listitem>
+
+<listitem><para>
+The scripts using <literal>mdo</literal> should <literal>import Control.Monad.MonadRec</literal>
+</para></listitem>
+
+<listitem><para>
+As with other extensions, ghc should be given the flag <literal>-fglasgow-exts</literal>
+</para></listitem>
+</itemizedlist>
+</para>
+
+<para>
+The MonadRec library introduces the <literal>MonadRec</literal> class. It's definition is:
+</para>
+<programlisting>
+class Monad m => MonadRec m where
+   mfix :: (a -> m a) -> m a
+</programlisting>
+<para>
+The <literal>MonadRec</literal> class declares the function <literal>mfix</literal>, 
+which dictates how the recursion should behave. If recursive bindings are required for a monad,
+then that monad must be declared an instance of the <literal>MonadRec</literal> class.
+For details, see the above mentione reference.
+</para>
+<para>
+The MonadRec library automatically declares List, Maybe, IO, and
+state monads (both lazy and strict) as instances of the <literal>MonadRec</literal> class.
+</para>
+
+<para>
+The web page: <ulink url="http://www.cse.ogi.edu/PacSoft/projects/rmb">http://www.cse.ogi.edu/PacSoft/projects/rmb</ulink>
+contains up to date information on recursive monadic bindings.
+</para>
+
+</sect2>
 </sect1>
 
 
-- 
1.7.10.4