Recursion is a computational effect Export

@misc{citeulike:70684, abstract = {In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could benefit from a combinator mfix for expressing recursion over monadic types. We investigate three possible definitions of mfix and implement them in Haskell. Like traditional fixpoint operators, there are two approaches to the definition of mfix: an unfolding one based on mathematical semantics, and an updating one based on operational semantics. The two definitions are equivalent in pure calculi...}, author = {Friedman, D. and Sabry, A.}, citeulike-article-id = {70684}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6244}, keywords = {effects, monads}, posted-at = {2005-01-10 23:28:35}, priority = {2}, title = {Recursion is a computational effect}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6244}, year = {2000} }

TY - GEN ID - citeulike:70684 L3 - citeulike-article-id:70684 N2 - In a recent paper, Launchbury, Lewis, and Cook observe that some Haskell applications could benefit from a combinator mfix for expressing recursion over monadic types. We investigate three possible definitions of mfix and implement them in Haskell. Like traditional fixpoint operators, there are two approaches to the definition of mfix: an unfolding one based on mathematical semantics, and an updating one based on operational semantics. The two definitions are equivalent in pure calculi... TI - Recursion is a computational effect KW - effects KW - monads AU - Friedman, D AU - Sabry, A PY - 2000/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6244 ER -