|
|
|
|
Synopsis |
|
|
|
Documentation |
|
class (Monoid a, Ord a) => OrdMonoid a |
A class for ordered monoids.
| | Instances | |
|
|
class (OrdMonoid a, Show a) => GoodMonoid a |
The class GoodMonoid of good monoids is the preferred class to use to
generate rings with good properties, for example rings with a Show
method.
| | Instances | |
|
|
class Monoid a => GradedMonoid a where |
Define a class for graded monoids, like free commutative monoids.
| | Methods | | | Instances | |
|
|
class GoodMonoid a => GroebnerMonoid a where |
The GroebnerMonoid class gathers monoids with enough structure
to allow computation of Groebner bases
| | Methods | (×) :: a -> a -> a | Multiplication
| | (÷) :: a -> a -> a | Division, which should only be used if exponents remain positive
| | lcm_monom :: a -> a -> a | Returns the least common multiple of monomials.
| | lcm2_monom :: a -> a -> (a, a) | Returns the least common multiple of monomials and the
complements.
| | gcd_monom :: a -> a -> a | Returns the greatest common divisor of monomials.
| | divides :: a -> a -> Bool | Tests divisibility
|
| | Instances | |
|
|
Produced by Haddock version 2.3.0 |