monoid-absorbing: A library for (left, right) zero monoids and backtracking with cut
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.
A library for (left, right) zero monoids, that is, monoids with (left, right) absorbing elements. Includes free constructions of those and a list monad transformer with Prolog's cut operator, which is related to the theory of right zero monoids.
Properties
| Versions | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.4 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4 && <5), mtl (>=2 && <3) [details] |
| License | MIT |
| Copyright | 2015 Maciej Piróg |
| Author | Maciej Piróg |
| Maintainer | maciej.adam.pirog@gmail.com |
| Category | Algebra |
| Home page | http://github.com/maciejpirog/monoid-absorbing |
| Bug tracker | http://github.com/maciejpirog/monoid-absorbing/issues |
| Source repo | head: git clone git://github.com/maciejpirog/monoid-absorbing.git |
| Uploaded | by maciejpirog at 2015-10-16T08:39:36Z |
Modules
- Data
- List
- Data.List.Cut
- Monoid
- Data.Monoid.Zero
- List
Downloads
- monoid-absorbing-0.1.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees