Top 2.0% downloads on hackage.haskell.org
Top 1.4% dependent packages on hackage.haskell.org
Top 5.1% dependent repos on hackage.haskell.org
Top 5.4% forks on hackage.haskell.org
hackage.haskell.org : recursion-schemes
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
-
Source
- Homepage
- JSON
- codemeta.json
purl: pkg:hackage/recursion-schemes
Keywords:
bsd2
, control
, library
, recursion
, Propose Tags
License: BSD-2-Clause
Latest release: over 1 year ago
First release: almost 15 years ago
Dependent packages: 20
Dependent repositories: 122
Downloads: 70,954 total
Stars: 350 on GitHub
Forks: 61 on GitHub
Total Commits: 251
Committers: 26
Average commits per author: 9.654
Development Distribution Score (DDS): 0.669
More commit stats: commits.ecosyste.ms
See more repository details: repos.ecosyste.ms
Last synced: 29 days ago