Safe Haskell	Safe
Language	Haskell98

Numeric.Decidable.Associates

Documentation

class Unital r => DecidableAssociates r where #

Minimal complete definition

isAssociate

Methods

isAssociate :: r -> r -> Bool #

b is an associate of a if there exists a unit u such that b = a*u

This relationship is symmetric because if u is a unit, u^-1 exists and is a unit, so

b*u^-1 = a*u*u^-1 = a

Instances

DecidableAssociates Bool #
Methods isAssociate :: Bool -> Bool -> Bool #
DecidableAssociates Int #
Methods isAssociate :: Int -> Int -> Bool #
DecidableAssociates Int8 #
Methods isAssociate :: Int8 -> Int8 -> Bool #
DecidableAssociates Int16 #
Methods isAssociate :: Int16 -> Int16 -> Bool #
DecidableAssociates Int32 #
Methods isAssociate :: Int32 -> Int32 -> Bool #
DecidableAssociates Int64 #
Methods isAssociate :: Int64 -> Int64 -> Bool #
DecidableAssociates Integer #
Methods isAssociate :: Integer -> Integer -> Bool #
DecidableAssociates Natural #
Methods isAssociate :: Natural -> Natural -> Bool #
DecidableAssociates Word #
Methods isAssociate :: Word -> Word -> Bool #
DecidableAssociates Word8 #
Methods isAssociate :: Word8 -> Word8 -> Bool #
DecidableAssociates Word16 #
Methods isAssociate :: Word16 -> Word16 -> Bool #
DecidableAssociates Word32 #
Methods isAssociate :: Word32 -> Word32 -> Bool #
DecidableAssociates Word64 #
Methods isAssociate :: Word64 -> Word64 -> Bool #
DecidableAssociates () #
Methods isAssociate :: () -> () -> Bool #
DecidableAssociates r => DecidableAssociates (Opposite r) #
Methods isAssociate :: Opposite r -> Opposite r -> Bool #
DecidableAssociates (BasisCoblade m) #
Methods isAssociate :: BasisCoblade m -> BasisCoblade m -> Bool #
GCDDomain d => DecidableAssociates (Fraction d) #
Methods isAssociate :: Fraction d -> Fraction d -> Bool #
(DecidableAssociates a, DecidableAssociates b) => DecidableAssociates (a, b) #
Methods isAssociate :: (a, b) -> (a, b) -> Bool #
(DecidableAssociates a, DecidableAssociates b, DecidableAssociates c) => DecidableAssociates (a, b, c) #
Methods isAssociate :: (a, b, c) -> (a, b, c) -> Bool #
(DecidableAssociates a, DecidableAssociates b, DecidableAssociates c, DecidableAssociates d) => DecidableAssociates (a, b, c, d) #
Methods isAssociate :: (a, b, c, d) -> (a, b, c, d) -> Bool #
(DecidableAssociates a, DecidableAssociates b, DecidableAssociates c, DecidableAssociates d, DecidableAssociates e) => DecidableAssociates (a, b, c, d, e) #
Methods isAssociate :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

isAssociateIntegral :: (Eq n, Num n) => n -> n -> Bool #

isAssociateWhole :: Eq n => n -> n -> Bool #