setoid: A Haskell implementation of setoid
Deprecated
in favor of skeletal-set
Setoid (https://en.wikipedia.org/wiki/Setoid) is a set equipped with an equivalence relation. Setoid is a useful data structure in cases where equivalence is chosen not to be equality. One can use it to influence the memberships of the elements more strictly, as opposed to sets, and run computations on unions when conflicts between elements are found.
You can find more deatails in Data.Setoid
[Skip to Readme]
Downloads
- setoid-0.1.0.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.0 |
---|---|
Change log | changelog.md |
Dependencies | base (>=4.7 && <5), containers (>=0.5 && <0.6) [details] |
License | BSD-3-Clause |
Copyright | Global Access Internet Services GmbH |
Author | Pavlo Kerestey |
Maintainer | kerestey@global.de |
Category | Data |
Uploaded | by PavloKerestey at 2017-03-12T17:25:25Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 962 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 2017-03-12 [all 1 reports] |