• Practical Recursion Schemes -
  Introduction to pattern functors, fix points, anamorphisms, catamorphisms,
  paramorphisms and hylomorphisms, requiring very little prior knowledge.
• An Introduction to Recursion Schemes -
  Three-part series in which you discover recursion schemes from scratch and
  implement a small subset of Edward Kmett's library.
• Understanding Algebras -
  Bartosz Milewski explains F-algebras and shows how to use them in the context of
  catamorphisms.
• Recursion Schemes in JavaScript and Flow -
  Series introducing recursion schemes and related concepts in JavaScript,
  aimed at developers with a minimal functional programming background.

• Recursion Schemes: A Field Guide (Redux) -
  List of various recursion schemes with code samples.
• Catamorphisms -
  Short definition with code on School of Haskell by Edward Kmett.

Articles by Bartosz Milewski about solving small, practical problems by applying a hylomorphism.

• Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, 1991, Meijer et al. -
  The original paper most of this is based on.
• A Duality of Sorts, 2013, Hinze et al. -
  Shows that many basic sorting algorithms exist as a pair, and that these pairs
  arise naturally out of the duality between folds and unfolds.
• Sorting with Bialgebras and Distributive Laws, 2012, Hinze et al. -
  Shows how paramorphisms and apomorphisms can be used for more efficient
  implementations of sorting algorithms.
• Scrap your boilerplate: a practical design pattern for generic programming, 2003, SPJ et al. -
  Design pattern for writing programs that traverse data structures built from rich mutually-recursive data types.

• Slidedecks by Tim Philip Williams -
  "Recursion Schemes by Example" and "Exotic Tools for Exotic Trades" provide
  concise definitions as well as practical examples of many recursion schemes.
• Unifying Structured Recursion Schemes -
  12 min presentation by Ralf Hinze, Nicolas Wu, and Jeremy Gibbons.
• Recursion Schemes -
  Presented by Tim Williams at the London Haskell meetup.
• F-algebras or: How I Learned to Stop Worrying and Love the Type System -
  Presented by Anthony Burzillo at the NYC Haskell User's Group.
• A Gentle Introduction to Recursion Schemes -
  Presented by Jean Remi Desjardins at Lambdaconf 2016.

category theory that often bring up recursion schemes, including episode
33 which talks about Histomorphisms
and Futumorphisms.
recursion schemes in the second episode.
Episode 13 with John Wiegley.

• recursion-schemes for
  Haskell - The canonical implementation by Edward Kmett.
• Matryoshka for Scala using Scalaz -
  Generalized folds, unfolds, and traversals for fixed point data structures.
• andyscott/droste for Scala using Cats -
  Generalized folds, unfolds, and traversals for fixed point data structures.
• recursion_schemes for
  Idris, based off Edward Kmett's Haskell library.
• purescript-matryoshka for PureScript -
  Work-in-process port of matryoshka.
• recursion for ATS - Demonstration of
  recursion schemes in ATS.
• dada for Dhall - a library for recursion
  schemes in Dhall.
• static-land-recursion-schemes for JavaScript/Flow -
  Schemes for data structures written in the style of flow-static-land.
• Katalyst for Kotlin - a re-envisioning based off Matryoshka using lightweight higher kinded polymorphism.