|Version 1 (modified by 11 years ago) (diff),|
Recursive Do Notation
An extended form of
do notation allowing feedback for monads in the MonadFix class.
- makes programs much more readable that the equivalent forms using
- not backward compatible with Haskell 98, unless a different keyword is used: using a variable before it is bound is treated as recursion.
- a dependency analysis is required to determine the semantics.