unfix-binders: Unfixing and recursion schemes for data types with binders
Use fixed-point of endofunctors of endofunctors (that is initial algebras in the category of endofunctors) to define recursion schemes for data types with binders
[Skip to Readme]
Downloads
- unfix-binders-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.12 && <4.13) [details] |
| License | BSD-3-Clause |
| Copyright | 2018 Arnaud Spiwack |
| Author | Arnaud Spiwack |
| Maintainer | arnaud@spiwack.net |
| Category | Data |
| Home page | https://github.com/aspiwack/peppermint-prover |
| Uploaded | by aspiwack at 2018-10-11T09:07:42Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 811 total (4 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |