Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype Monomial ord n = Monomial {
- getMonomial :: Mon n
- type Mon n = Sized' n Int
- type SNat (n :: Nat) = Sing n
- data Lex
- data Revlex
- class IsMonomialOrder (ord :: *)
- toMonomial :: (IsMonomialOrder ord, KnownNat n) => [Int] -> Monomial ord n
Types
newtype Monomial ord n Source #
Monomial is defined as an array of exponents
Monomial | |
|
Instances
Eq (Monomial ord n) Source # | |
IsMonomialOrder ord => Ord (Monomial ord n) Source # | |
Defined in Polynomial.Monomial compare :: Monomial ord n -> Monomial ord n -> Ordering # (<) :: Monomial ord n -> Monomial ord n -> Bool # (<=) :: Monomial ord n -> Monomial ord n -> Bool # (>) :: Monomial ord n -> Monomial ord n -> Bool # (>=) :: Monomial ord n -> Monomial ord n -> Bool # | |
Show (Monomial ord n) Source # | |
(IsMonomialOrder ord, KnownNat n) => Unital (Monomial ord n) Source # | |
(IsMonomialOrder ord, KnownNat n) => Multiplicative (Monomial ord n) Source # | |
Wrapped (Monomial ord n) Source # | |
Monomial ord1 n1 ~ t => Rewrapped (Monomial ord2 n2) t Source # | |
Defined in Polynomial.Monomial | |
type Unwrapped (Monomial ord n) Source # | |
Defined in Polynomial.Monomial |
Instances
IsMonomialOrder Lex Source # | |
Defined in Polynomial.Monomial | |
(Unital k, Show k, Eq k) => Show (Polynomial k Lex n) # | |
Defined in Polynomial.Prelude |
Instances
IsMonomialOrder Revlex Source # | |
Defined in Polynomial.Monomial | |
(KnownNat n, Unital k, Show k, Eq k) => Show (Polynomial k Revlex n) # | |
Defined in Polynomial.Prelude |
Classes
class IsMonomialOrder (ord :: *) Source #
Definition of what a monomial order must meet
compareMonomial
Instances
IsMonomialOrder Revlex Source # | |
Defined in Polynomial.Monomial | |
IsMonomialOrder Lex Source # | |
Defined in Polynomial.Monomial |
Functions
toMonomial :: (IsMonomialOrder ord, KnownNat n) => [Int] -> Monomial ord n Source #