SAT-Pol-0.1.0.0
Haskell4Maths
data F2 :: * #
Instances
Methods
(==) :: F2 -> F2 -> Bool #
(/=) :: F2 -> F2 -> Bool #
(/) :: F2 -> F2 -> F2 #
recip :: F2 -> F2 #
fromRational :: Rational -> F2 #
(+) :: F2 -> F2 -> F2 #
(-) :: F2 -> F2 -> F2 #
(*) :: F2 -> F2 -> F2 #
negate :: F2 -> F2 #
abs :: F2 -> F2 #
signum :: F2 -> F2 #
fromInteger :: Integer -> F2 #
compare :: F2 -> F2 -> Ordering #
(<) :: F2 -> F2 -> Bool #
(<=) :: F2 -> F2 -> Bool #
(>) :: F2 -> F2 -> Bool #
(>=) :: F2 -> F2 -> Bool #
max :: F2 -> F2 -> F2 #
min :: F2 -> F2 -> F2 #
showsPrec :: Int -> F2 -> ShowS #
show :: F2 -> String #
showList :: [F2] -> ShowS #
elts :: [F2]
data MonImpl v :: * -> * #
Constructors
fmap :: (a -> b) -> MonImpl a -> MonImpl b #
(<$) :: a -> MonImpl b -> MonImpl a #
mvar :: v -> MonImpl v
mindices :: MonImpl v -> [(v, Int)] #
(==) :: MonImpl v -> MonImpl v -> Bool #
(/=) :: MonImpl v -> MonImpl v -> Bool #
showsPrec :: Int -> MonImpl v -> ShowS #
show :: MonImpl v -> String #
showList :: [MonImpl v] -> ShowS #
munit :: MonImpl v
mmult :: MonImpl v -> MonImpl v -> MonImpl v
mdivides :: MonImpl v -> MonImpl v -> Bool
mdiv :: MonImpl v -> MonImpl v -> MonImpl v
mgcd :: MonImpl v -> MonImpl v -> MonImpl v
mlcm :: MonImpl v -> MonImpl v -> MonImpl v
mcoprime :: MonImpl v -> MonImpl v -> Bool
mdeg :: MonImpl v -> Int
newtype Vect k b :: * -> * -> * #
(>>=) :: Vect k a -> (a -> Vect k b) -> Vect k b #
(>>) :: Vect k a -> Vect k b -> Vect k b #
return :: a -> Vect k a #
fail :: String -> Vect k a #
fmap :: (a -> b) -> Vect k a -> Vect k b #
(<$) :: a -> Vect k b -> Vect k a #
pure :: a -> Vect k a #
(<*>) :: Vect k (a -> b) -> Vect k a -> Vect k b #
liftA2 :: (a -> b -> c) -> Vect k a -> Vect k b -> Vect k c #
(*>) :: Vect k a -> Vect k b -> Vect k b #
(<*) :: Vect k a -> Vect k b -> Vect k a #
(==) :: Vect k b -> Vect k b -> Bool #
(/=) :: Vect k b -> Vect k b -> Bool #
compare :: Vect k b -> Vect k b -> Ordering #
(<) :: Vect k b -> Vect k b -> Bool #
(<=) :: Vect k b -> Vect k b -> Bool #
(>) :: Vect k b -> Vect k b -> Bool #
(>=) :: Vect k b -> Vect k b -> Bool #
max :: Vect k b -> Vect k b -> Vect k b #
min :: Vect k b -> Vect k b -> Vect k b #
showsPrec :: Int -> Vect k b -> ShowS #
show :: Vect k b -> String #
showList :: [Vect k b] -> ShowS #
linear :: (Eq k, Num k, Ord b) => (a -> Vect k b) -> Vect k a -> Vect k b #
zerov :: Vect k b #
newtype Lex v :: * -> * #
fmap :: (a -> b) -> Lex a -> Lex b #
(<$) :: a -> Lex b -> Lex a #
mvar :: v -> Lex v
mindices :: Lex v -> [(v, Int)] #
unit :: k -> Vect k (Lex v)
mult :: Vect k (Tensor (Lex v) (Lex v)) -> Vect k (Lex v)
(==) :: Lex v -> Lex v -> Bool #
(/=) :: Lex v -> Lex v -> Bool #
compare :: Lex v -> Lex v -> Ordering #
(<) :: Lex v -> Lex v -> Bool #
(<=) :: Lex v -> Lex v -> Bool #
(>) :: Lex v -> Lex v -> Bool #
(>=) :: Lex v -> Lex v -> Bool #
max :: Lex v -> Lex v -> Lex v #
min :: Lex v -> Lex v -> Lex v #
showsPrec :: Int -> Lex v -> ShowS #
show :: Lex v -> String #
showList :: [Lex v] -> ShowS #
munit :: Lex v
mmult :: Lex v -> Lex v -> Lex v
mdivides :: Lex v -> Lex v -> Bool
mdiv :: Lex v -> Lex v -> Lex v
mgcd :: Lex v -> Lex v -> Lex v
mlcm :: Lex v -> Lex v -> Lex v
mcoprime :: Lex v -> Lex v -> Bool
mdeg :: Lex v -> Int
data Glex v :: * -> * #
fmap :: (a -> b) -> Glex a -> Glex b #
(<$) :: a -> Glex b -> Glex a #
mvar :: v -> Glex v
mindices :: Glex v -> [(v, Int)] #
unit :: k -> Vect k (Glex v)
mult :: Vect k (Tensor (Glex v) (Glex v)) -> Vect k (Glex v)
(==) :: Glex v -> Glex v -> Bool #
(/=) :: Glex v -> Glex v -> Bool #
compare :: Glex v -> Glex v -> Ordering #
(<) :: Glex v -> Glex v -> Bool #
(<=) :: Glex v -> Glex v -> Bool #
(>) :: Glex v -> Glex v -> Bool #
(>=) :: Glex v -> Glex v -> Bool #
max :: Glex v -> Glex v -> Glex v #
min :: Glex v -> Glex v -> Glex v #
showsPrec :: Int -> Glex v -> ShowS #
show :: Glex v -> String #
showList :: [Glex v] -> ShowS #
munit :: Glex v
mmult :: Glex v -> Glex v -> Glex v
mdivides :: Glex v -> Glex v -> Bool
mdiv :: Glex v -> Glex v -> Glex v
mgcd :: Glex v -> Glex v -> Glex v
mlcm :: Glex v -> Glex v -> Glex v
mcoprime :: Glex v -> Glex v -> Bool
mdeg :: Glex v -> Int
data Grevlex v :: * -> * #
fmap :: (a -> b) -> Grevlex a -> Grevlex b #
(<$) :: a -> Grevlex b -> Grevlex a #
mvar :: v -> Grevlex v
mindices :: Grevlex v -> [(v, Int)] #
unit :: k -> Vect k (Grevlex v)
mult :: Vect k (Tensor (Grevlex v) (Grevlex v)) -> Vect k (Grevlex v)
(==) :: Grevlex v -> Grevlex v -> Bool #
(/=) :: Grevlex v -> Grevlex v -> Bool #
compare :: Grevlex v -> Grevlex v -> Ordering #
(<) :: Grevlex v -> Grevlex v -> Bool #
(<=) :: Grevlex v -> Grevlex v -> Bool #
(>) :: Grevlex v -> Grevlex v -> Bool #
(>=) :: Grevlex v -> Grevlex v -> Bool #
max :: Grevlex v -> Grevlex v -> Grevlex v #
min :: Grevlex v -> Grevlex v -> Grevlex v #
showsPrec :: Int -> Grevlex v -> ShowS #
show :: Grevlex v -> String #
showList :: [Grevlex v] -> ShowS #
munit :: Grevlex v
mmult :: Grevlex v -> Grevlex v -> Grevlex v
mdivides :: Grevlex v -> Grevlex v -> Bool
mdiv :: Grevlex v -> Grevlex v -> Grevlex v
mgcd :: Grevlex v -> Grevlex v -> Grevlex v
mlcm :: Grevlex v -> Grevlex v -> Grevlex v
mcoprime :: Grevlex v -> Grevlex v -> Bool
mdeg :: Grevlex v -> Int
var :: (Num k, MonomialConstructor m) => v -> Vect k (m v) #
mindices :: MonomialConstructor m => forall v. m v -> [(v, Int)] #
lm :: Vect b c -> c #
lt :: Vect k b -> (b, k) #
eval :: (Eq k, Num k, MonomialConstructor m, Eq (m v), Show v) => Vect k (m v) -> [(Vect k (m v), k)] -> k #
(%%) :: (Eq k, Fractional k, Monomial m, Ord m, Algebra k m) => Vect k m -> [Vect k m] -> Vect k m #
vars :: (Num k, Ord k, MonomialConstructor m, Ord (m v)) => Vect k (m v) -> [Vect k (m v)] #