(Apologies to the list: The previous version of this message got out a little
premature, here's the complete version of it..)
Here's the pointer:
http://www.cse.ogi.edu/PacSoft/projects/muHugs/
The paper titled "Recursive Monadic Bindings" explains the ideas. (It also
briefly talks about the let-problem.)
The problem with let-generators (among other things) are detailed in the paper
titled: "A Recursive do for Haskell: Design And Implementation"
The technical report: "Recursive monadic Bindings: Proofs and Details"
contains the technical development, proofs and other details.
All links are to the latest versions of these documents and the contents
are subject to change before final submissions are made, so these
versions should be considered as drafts.
If you want to try the new mdo notation, the web-page also contains the
sources of a modified version of Hugs that contains a prototype implementation
of mdo: dowloading and installation instructions are given on the page. (It
might have bugs and it performs a rather simplified version of the translation
we describe in the second paper mentioned above, but it's a nice tool to test
the ideas..)
We'll appreciate comments, suggestions, bug reports...
Thanks,
-Levent.
