hackage.haskell.org : recursion-schemes : 5.2.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@5.2.1
Published:
Indexed:
Related tag:
v5.2.1
Loading...
Readme
Loading...
Dependencies
- base >=4.5 && <5
- base-orphans >=0.5.4 && <0.9
- bifunctors >=4 && <6
- comonad >=4 && <6
- containers >=0.4.2.1 && <0.7
- data-fix >=0.3.0 && <0.4
- free >=4 && <6
- ghc-prim *
- nats *
- semigroups >=0.10 && <1
- template-haskell >=2.5.0.0 && <2.18
- th-abstraction >=0.4 && <0.5
- transformers >=0.3.0.0 && <1
- transformers-compat >=0.3 && <1