semigroups

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.

• base == 2.*
• containers >= 0.3 && < 0.6
• nats >= 0.1 && < 0.3

• 0.20.1
• 0.20
• 0.19.2
• 0.19.1
• 0.19
• 0.18.5
• 0.18.4
• 0.18.3
• 0.18.2
• 0.18.1
• 0.18.0.1
• 0.18
• 0.17.0.1
• 0.17
• 0.16.2.2
• 0.16.2.1
• 0.16.2
• 0.16.1
• 0.16.0.1
• 0.16
• 0.15.4
• 0.15.3
• 0.15.2
• 0.15.1
• 0.15
• 0.14
• 0.13.0.1
• 0.13
• 0.12.2
• 0.12.1
• 0.12.0.1
• 0.12
• 0.11
• 0.10
• 0.9.2
• 0.9.1
• 0.9
• 0.8.5
• 0.8.4.1
• 0.8.4
• 0.8.3.2
• 0.8.3.1
• 0.8.3
• 0.8.2
• 0.8.0.1
• 0.8
• 0.7.1.2
• 0.7.1.1
• 0.7.1
• 0.7.0
• 0.6.1
• 0.6
• 0.5.0.2
• 0.5.0.1
• 0.5.0
• 0.4.0
• 0.3.4.2
• 0.3.4.1
• 0.3.4
• 0.3.3
• 0.3.2
• 0.3.1
• 0.3.0
• 0.2.0
• 0.1.0