setoid: A Haskell implementation of setoid
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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]
Properties
Versions | 0.1.0.0, 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:23:55Z |
Modules
[Index]
Downloads
- setoid-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees