monoid-absorbing: A library for (left, right) zero monoids and backtracking with cut

[ algebra, library, mit ] [ Propose Tags ]

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.

Modules

[Last Documentation]

  • Data
    • List
      • Data.List.Cut
    • Monoid
      • Data.Monoid.Zero

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.0.4
Dependencies base (>=4 && <5), mtl [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
Uploaded by maciejpirog at 2015-10-15T17:15:38Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2500 total (10 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 2016-11-30 [all 5 reports]