A recursive do for Haskell

Authors:
Levent Erkök;John Launchbury
Affiliations:
OGI School of Science and Engineering, OHSU;OGI School of Science and Engineering, OHSU
Venue:
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Year:
2002

Citing 7
Cited 10

Simple imperative polymorphism

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
First-class polymorphism with type inference

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On embedding a microarchitectural design language within Haskell

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Recursive monadic bindings

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A new notation for arrows

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Microprocessor Specification in Hawk

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
A Recursive do for Haskell: Design And Implementation

A Recursive do for Haskell: Design And Implementation

A type system for well-founded recursion

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-safe, self inspecting code

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Shortcut fusion rules for the derivation of circular and higher-order monadic programs

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Categorical semantics for arrows

Journal of Functional Programming
Type-safe observable sharing in Haskell

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Arrows, like Monads, are Monoids

Electronic Notes in Theoretical Computer Science (ENTCS)
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge

Electronic Notes in Theoretical Computer Science (ENTCS)
Mixin modules and computational effects

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Shortcut fusion rules for the derivation of circular and higher-order programs

Higher-Order and Symbolic Computation
Fixing idioms: a recursion primitive for applicative DSLs

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. In this paper, we describe an enhanced translation schema for the donotation and its integration into Haskell. The new translation allows variables to be bound recursively, provided the underlying monad comes equipped with an appropriate fixed-point operator.