Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
| Hi-index | 0.00 |
Certain programs making use of monads need to perform recursion over the values of monadic actions. Although the do-notation of Haskell provides a convenient framework for monadic programming, it lacks the generality to support such recursive bindings. To remedy this problem, we propose an extension to Haskell''s do-notation and describe its translation into the core language.