partial-order: Provides typeclass suitable for types admitting a partial order
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.
This packages provides the PartialOrd typeclass suitable for types admitting a partial order. The only module exposed by this package is Data.PartialOrd. Along with the PartialOrd typeclass and some utility functions for working with partially ordered types, it exports instances for certain numeric types along with instances for lists and sets.
Properties
| Versions | 0.1.0, 0.1.2, 0.1.2.1, 0.2.0.0 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.7 && <5), containers (>=0.5.0.0 && <0.6) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2016 Moritz Schulte |
| Author | Moritz Schulte |
| Maintainer | mtesseract@silverratio.net |
| Category | Data |
| Home page | https://github.com/mtesseract/partial-order |
| Source repo | head: git clone https://github.com/mtesseract/haskell-partial-order |
| Uploaded | by mtesseract at 2016-09-16T16:28:33Z |
Modules
[Index]
- Data
Downloads
- partial-order-0.1.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