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.
| Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
|---|---|---|---|---|---|
| 5.2.2.5-bp156.1.1 info | GA Release | 2024-03-05 | 15 SP6 |
|
|
| 5.2.2.2-bp155.2.14 info | GA Release | 2023-05-22 | 15 SP5 |
|
|
| 5.2.2.2-bp154.1.14 info | GA Release | 2022-05-09 | 15 SP4 |
|
|
| 5.0.2-bp150.1.3 info | GA Release | 2018-07-30 | 15 |
|
|