eliminators: Dependently typed elimination functions using singletons
This library provides eliminators for inductive data types,
leveraging the power of the singletons library to allow
dependently typed elimination.
[Skip to Readme]
Modules
- Data
- Data.Eliminator
- Data.Eliminator.Functor
- Data.Eliminator.Monoid
- Data.Eliminator.Semigroup
- Data.Eliminator.TH
- Data.Eliminator.TypeNats
- Data.Eliminator
Downloads
- eliminators-0.9.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.2, 0.3, 0.4, 0.4.1, 0.5, 0.5.1, 0.6, 0.7, 0.8, 0.9, 0.9.1, 0.9.2, 0.9.3, 0.9.4, 0.9.5 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.16 && <4.17), extra (>=1.4.2 && <1.8), singleton-nats (>=0.4.2 && <0.5), singletons-base (>=3.1 && <3.2), template-haskell (>=2.18 && <2.19), th-abstraction (>=0.4 && <0.5), th-desugar (>=1.13 && <1.14) [details] |
| Tested with | ghc ==9.2.1 |
| License | BSD-3-Clause |
| Copyright | (C) 2017 Ryan Scott |
| Author | Ryan Scott |
| Maintainer | Ryan Scott <ryan.gl.scott@gmail.com> |
| Category | Dependent Types |
| Home page | https://github.com/RyanGlScott/eliminators |
| Bug tracker | https://github.com/RyanGlScott/eliminators/issues |
| Source repo | head: git clone https://github.com/RyanGlScott/eliminators |
| Uploaded | by ryanglscott at 2021-10-31T14:45:45Z |
| Distributions | LTSHaskell:0.9.3, NixOS:0.9.3, Stackage:0.9.4 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 6202 total (59 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] All reported builds failed as of 2021-10-31 [all 2 reports] |
Readme for eliminators-0.9
[back to package description]eliminators
This library provides eliminators for inductive data types, leveraging the power of the singletons library to allow dependently typed elimination.