Tuesday, March 5, 2013 [Tweets] [Favorites]

Higher-Order List Operations

Matt Might (via @CompSciFact):

While recursion is better than iteration for functional programming, new functional programmers are unaware of powerful libraries to encapsulate recursion over common data structures like lists.

This post explains some of the common higher-order list operations in Racket and Haskell by re-implementing them.

Comments

Stay up-to-date by subscribing to the Comments RSS Feed for this post.

Leave a Comment