unfree: Simplistic free monad with deriving through UndecidableInstances
Downloads
- unfree-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
- No Candidates
| Versions [RSS] | 0.1.0 |
|---|---|
| Dependencies | base (>=4.12 && <5), deepseq (>=1.4 && <1.5), hashable (>=1.3 && <1.5), recursion-schemes (>=5.2 && <5.3) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2022 Eric Conlon |
| Author | Eric Conlon |
| Maintainer | ejconlon@gmail.com |
| Category | Control |
| Home page | https://github.com/ejconlon/unfree#readme |
| Bug tracker | https://github.com/ejconlon/unfree/issues |
| Source repo | head: git clone https://github.com/ejconlon/unfree |
| Uploaded | by ejconlon at 2022-10-03T01:58:32Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 125 total (5 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2022-10-03 [all 1 reports] |
Readme for unfree-0.1.0
[back to package description]unfree
Simplistic free monad with deriving through UndecidableInstances
Why does this exist when free is ubiquitous? Sometimes you just want to easily derive Eq without having to define Eq1 for your functor, or maybe you just want a Hashable instance. (Maybe someday the situation will improve with quantified constrant superclasses.)