hackage.haskell.org : recursion-schemes : 3.0.0.1
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.
Registry -
Download -
JSON
purl: pkg:hackage/recursion-schemes@3.0.0.1
Published:
Indexed:
Loading...
Readme
Loading...
Dependencies
- base >=4 && <5
- comonad >=3.0 && <3.1
- comonad-transformers >=3.0 && <3.1
- free >=3.2 && <3.4
- transformers >=0.2 && <0.4