|(3 intermediate revisions by 2 users not shown)|
Latest revision as of 15:28, 15 August 2009
 1 QuestionWhy are there several notions of power in Haskell, namely
 2 Answer
The reason is that there is no definition for the power function which covers all exotic choices for basis and exponent. It is even sensible to refine the set of power functions as it is done in the Numeric Prelude project. In mathematical notation we don't respect types and we do not distinguish between powers of different types. However if we assume the most general types for both basis and exponent, the result of the power is no longer unique. Actually all possible solutions of say 1x, where x is irrational is dense in the complex unit circle. In the past I needed the power of two complex numbers only once, namely for the Cauchy wavelet (see also: ):
However, I could not use the built-in complex power function because the resulting function became discontinuous. Of course, powers of complex numbers have the problem of branch cuts and the choice of the branch built into the implementation of the complex power is quite arbitrary and might be inappropriate.
But also for real numbers there are problems:For computing
and a real 1015th root of − 1 does not exist. Fortunately, the Haskell implementation does not try to be too clever here. But it does so at another point:
Prelude> (-1)**2 :: Double 1.0 Prelude> (-1)**(2 + 1e-15 - 1e-15) :: Double NaN
but a reliable check for integers is not possible with floating point numbers.
So I propose some balancing: The more general the basis the less general the exponent and vice versa. I also think the following symbols are more systematic and intuitive. They are used in NumericPrelude.
|basis type||provides||symbol||exponent type||definition|
|integer||multiplication and division|
|an algebraic field||
|rational||list of polynomial zeros (length = denominator of the exponent)|
|^?||any ring of characteristic zero with inverses for integers and a notion of limit||exponential series and logarithm|
- examples for rings are: Polynomials, Matrices, Residue classes
- examples for fields: Fractions of polynomials (rational functions), Residue classes with respect to irreducible divisors, in fact we do not need fields, we only need the division and associativity, thus invertible Matrices are fine
 3 See also
- Haskell-Cafe: Proposal for restructuring Number classes