The latest version of recursion-schemes is 5.2.3-0.
recursion-schemes
Version 5.2.2.2 revision 1 uploaded by gelisam.
Package meta
- Synopsis
- Representing common recursion patterns as higher-order functions
- Description
Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.
- Author
- Edward A. Kmett
- Bug reports
- http://github.com/ekmett/recursion-schemes/issues
- Category
- Control, Recursion
- Copyright
- Copyright (C) 2008-2015 Edward A. Kmett
- Homepage
- http://github.com/ekmett/recursion-schemes/
- Maintainer
- "Samuel Gélineau" <gelisam@gmail.com>, "Ryan Scott" <ryan.gl.scott@gmail.com>, "Luc Tielen" <luc.tielen@gmail.com>
- Package URL
- n/a
- Stability
- provisional