The semigroups package

[Tags:bsd3, library]

Haskell 98 semigroups

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.


[Skip to Readme]

Properties

Versions 0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.4.1, 0.3.4.2, 0.4.0, 0.5.0, 0.5.0.1, 0.5.0.2, 0.6, 0.6.1, 0.7.0, 0.7.1, 0.7.1.1, 0.7.1.2, 0.8, 0.8.0.1, 0.8.2, 0.8.3, 0.8.3.1, 0.8.3.2, 0.8.4, 0.8.4.1, 0.8.5, 0.9, 0.9.1, 0.9.2, 0.10, 0.11, 0.12, 0.12.0.1, 0.12.1, 0.12.2, 0.13, 0.13.0.1, 0.14, 0.15, 0.15.1, 0.15.2, 0.15.3, 0.15.4, 0.16, 0.16.0.1, 0.16.1, 0.16.2, 0.16.2.1, 0.16.2.2, 0.17, 0.17.0.1, 0.18, 0.18.0.1, 0.18.1, 0.18.2
Dependencies base (>=2 && <4.9), containers (>=0.3 && <0.6) [details]
License BSD3
Copyright Copyright (C) 2011 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Stability provisional
Category Algebra, Data, Data Structures, Math
Home page http://github.com/ekmett/semigroups/
Bug tracker http://github.com/ekmett/semigroups/issues
Source repository head: git clone git://github.com/ekmett/semigroups.git
Uploaded Mon Aug 13 22:59:13 UTC 2012 by EdwardKmett
Updated Sat Jan 2 20:22:29 UTC 2016 by HerbertValerioRiedel to revision 1
Distributions Arch:0.18.2, Debian:0.18.0.1, Fedora:0.18.1, FreeBSD:0.16.2.2, LTSHaskell:0.18.1, NixOS:0.18.2, Stackage:0.18.2, Tumbleweed:0.18.1
Downloads 233716 total (135 in the last 30 days)
Votes
4 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Flags

NameDescriptionDefaultType
base2DisabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for semigroups

Readme for semigroups-0.8.4

semigroups

Build Status

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.

Semigroups appear all over the place, except in the Haskell Prelude, so they are packaged here.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett