Haskell 98 semigroups
http://hackage.haskell.org/package/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.
- Sources inherited from project openSUSE:Leap:42.3
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:42.3:Update/ghc-semigroups && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-semigroups.changes | 0000003101 3.03 KB | |
ghc-semigroups.spec | 0000002650 2.59 KB | |
semigroups-0.18.1.tar.gz | 0000016865 16.5 KB |
Revision 3 (latest revision is 7)
Ludwig Nussel (lnussel_factory)
accepted
request 402464
from
Ondřej Súkup (mimi_vx)
(revision 3)
- update to 0.18.1 * Add the missing instance for Data.Binary.Builder.Builder. - update to 0.18.0.1 - dropped nats.cabal.patch * Removed the partial functions words, unwords, lines, unlines * Added support for base-4.9 - update to 0.17.0.1 * Fixed the @since annotations * Added groupWith, groupAllWith, groupWith1, groupAllWith1 * Renamed sortOn to sortWith to match the "Comprehensive comprehensions" paper and TransformListComp extension. * Add Semigroup instances for Alt, Void, Proxy and Tagged * Add Num instances for Min and Max * Removed times1p in favor of stimes.
Comments 0