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

Algebra.ToInteger

Contents

Synopsis

# Documentation

class (C a, C a) => C a where Source #

The two classes C and C exist to allow convenient conversions, primarily between the built-in types. They should satisfy

  fromInteger .  toInteger === id
toRational .  toInteger === toRational

Conversions must be lossless, that is, they do not round in any way. For rounding see Algebra.RealRing.

I think that the RealIntegral superclass is too restrictive. Non-negative numbers are not a ring, but can be easily converted to Integers.

Minimal complete definition

toInteger

Methods

toInteger :: a -> Integer Source #

Instances

 Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods Integral a => C (T a) Source # MethodstoInteger :: T a -> Integer Source # (C a, C a) => C (T a) Source # MethodstoInteger :: T a -> Integer Source # C a => C (T a) Source # MethodstoInteger :: T a -> Integer Source #

fromIntegral :: (C a, C b) => a -> b Source #

ringPower :: (C a, C b) => b -> a -> a Source #

A prefix function of '(Algebra.Ring.^)' with a parameter order that fits the needs of partial application and function composition. It has generalised exponent.

See: Argument order of expNat on http://www.haskell.org/pipermail/haskell-cafe/2006-September/018022.html

fieldPower :: (C a, C b) => b -> a -> a Source #

A prefix function of '(Algebra.Field.^-)'. It has a generalised exponent.

# Orphan instances

 (C a, C a) => C (T a) Source # Methods