numeric-prelude-0.4.3: An experimental alternative hierarchy of numeric type classes

Safe Haskell Safe Haskell98

Algebra.Field

Contents

Synopsis

# Class

class C a => C a where Source #

Field again corresponds to a commutative ring. Division is partially defined and satisfies

   not (isZero b)  ==>  (a * b) / b === a
not (isZero a)  ==>  a * recip a === one

when it is defined. To safely call division, the program must take type-specific action; e.g., the following is appropriate in many cases:

safeRecip :: (Integral a, Eq a, Field.C a) => a -> Maybe a
safeRecip x =
let (q,r) = one divMod x
in  toMaybe (isZero r) q

Typical examples include rationals, the real numbers, and rational functions (ratios of polynomial functions). An instance should be typically declared only if most elements are invertible.

Actually, we have also used this type class for non-fields containing lots of units, e.g. residue classes with respect to non-primes and power series. So the restriction not (isZero a) must be better isUnit a.

Minimal definition: recip or (/)

Minimal complete definition

Methods

(/) :: a -> a -> a infixl 7 Source #

recip :: a -> a Source #

(^-) :: a -> Integer -> a infixr 8 Source #

Instances

 Source # Methods Source # Methods Source # Methods(/) :: T -> T -> T Source #recip :: T -> T Source #(^-) :: T -> Integer -> T Source # Source # Methods(/) :: T -> T -> T Source #recip :: T -> T Source #(^-) :: T -> Integer -> T Source # Source # Methods(/) :: T -> T -> T Source #recip :: T -> T Source #(^-) :: T -> Integer -> T Source # Integral a => C (Ratio a) Source # Methods(/) :: Ratio a -> Ratio a -> Ratio a Source #recip :: Ratio a -> Ratio a Source #(^-) :: Ratio a -> Integer -> Ratio a Source # RealFloat a => C (Complex a) Source # Methods(/) :: Complex a -> Complex a -> Complex a Source #recip :: Complex a -> Complex a Source #(^-) :: Complex a -> Integer -> Complex a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # Fractional a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # (Eq a, C a) => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # (C a, C a) => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # (C a, C a) => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # (C a, C a) => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C a => C (T a) Source # Methods(/) :: T a -> T a -> T a Source #recip :: T a -> T a Source #(^-) :: T a -> Integer -> T a Source # C v => C (T a v) Source # Methods(/) :: T a v -> T a v -> T a v Source #recip :: T a v -> T a v Source #(^-) :: T a v -> Integer -> T a v Source # (IsScalar u, C a) => C (T u a) Source # Methods(/) :: T u a -> T u a -> T u a Source #recip :: T u a -> T u a Source #(^-) :: T u a -> Integer -> T u a Source # (Ord i, C a) => C (T i a) Source # Methods(/) :: T i a -> T i a -> T i a Source #recip :: T i a -> T i a Source #(^-) :: T i a -> Integer -> T i a Source # C v => C (T a v) Source # Methods(/) :: T a v -> T a v -> T a v Source #recip :: T a v -> T a v Source #(^-) :: T a v -> Integer -> T a v Source #

(/) :: C a => a -> a -> a infixl 7 Source #

recip :: C a => a -> a Source #

fromRational :: C a => Rational -> a Source #

Needed to work around shortcomings in GHC.

(^-) :: C a => a -> Integer -> a infixr 8 Source #

# Properties

propDivision :: (Eq a, C a, C a) => a -> a -> Property Source #

the restriction on the divisor should be isUnit a instead of not (isZero a)

propReciprocal :: (Eq a, C a, C a) => a -> Property Source #