%0 Generic %1 Maguire2017Review %A Maguire, Sandy %D 2017 %K 03d20-recursive-functions-and-relations 03d75-abstract-and-axiomatic-computability-and-recursion-theory 68n18-functional-programming-and-lambda-calculus %T Review: Bananas, Lenses, Envelopes and Barbed Wire %U http://reasonablypolymorphic.com/blog/recursion-schemes %X Today's classic functional programming paper we will review is Meijer et al.'s Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. The exciting gist of the paper is that all explicit recursion can be factored out into a few core combinators. As such, the reasoning is that we should instead learn these combinators (or ” recursion schemes” as they're called), rather than doing our own ad-hoc recursion whenever we need it. Despite being a marvelous paper, it falls into the all-too-common flaw of functional programming papers, which is to have an absolutely horrible title. ” Bananas”, ” lenses”, ” envelopes” and ” barbed wire” correspond to obscure pieces of syntax invented to express these ideas. In our treatment of the literature, we will instead use standard Haskell syntax, and refer to the paper as Functional Programming with Recursion Schemes.

@electronic{Maguire2017Review, abstract = {{Today's classic functional programming paper we will review is Meijer et al.'s Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. The exciting gist of the paper is that all explicit recursion can be factored out into a few core combinators. As such, the reasoning is that we should instead learn these combinators (or ” recursion schemes” as they're called), rather than doing our own ad-hoc recursion whenever we need it. Despite being a marvelous paper, it falls into the all-too-common flaw of functional programming papers, which is to have an absolutely horrible title. ” Bananas”, ” lenses”, ” envelopes” and ” barbed wire” correspond to obscure pieces of syntax invented to express these ideas. In our treatment of the literature, we will instead use standard Haskell syntax, and refer to the paper as Functional Programming with Recursion Schemes.}}, added-at = {2019-03-01T00:11:50.000+0100}, author = {Maguire, Sandy}, biburl = {https://www.bibsonomy.org/bibtex/2da2c671ba646fadd11362e4f53033cb4/gdmcbain}, citeulike-article-id = {14449686}, citeulike-linkout-0 = {http://reasonablypolymorphic.com/blog/recursion-schemes}, day = 6, interhash = {1e800059397d22eb54d9344ed01adfd1}, intrahash = {da2c671ba646fadd11362e4f53033cb4}, keywords = {03d20-recursive-functions-and-relations 03d75-abstract-and-axiomatic-computability-and-recursion-theory 68n18-functional-programming-and-lambda-calculus}, month = oct, posted-at = {2017-10-13 01:01:11}, priority = {0}, timestamp = {2019-03-01T00:11:50.000+0100}, title = {{Review: Bananas, Lenses, Envelopes and Barbed Wire}}, url = {http://reasonablypolymorphic.com/blog/recursion-schemes}, year = 2017 }