numeric-prelude: An experimental alternative hierarchy of numeric type classes
Revisiting the Numeric Classes
The Prelude for Haskell 98 offers a well-considered set of numeric classes
which covers the standard numeric types
Complex) quite well.
But they offer limited extensibility and have a few other flaws.
In this proposal we will revisit these classes, addressing the following concerns:
- The current Prelude defines no semantics for the fundamental operations. For instance, presumably addition should be associative (or come as close as feasible), but this is not mentioned anywhere.
- There are some superfluous superclasses.
Showare superclasses of
Num. Consider the data type
data IntegerFunction a = IF (a -> Integer)One can reasonably define all the methods of
IntegerFunction a(satisfying good semantics), but it is impossible to define non-bottom instances of
Show. In general, superclass relationship should indicate some semantic connection between the two classes.
- In a few cases, there is a mix of semantic operations and
toRational, and the various operations in
decodeFloat, ...) are the main examples.
- In some cases, the hierarchy is not finely-grained enough: Operations that are often defined independently are lumped together. For instance, in a financial application one might want a type "Dollar", or in a graphics application one might want a type "Vector". It is reasonable to add two Vectors or Dollars, but not, in general, reasonable to multiply them. But the programmer is currently forced to define a method for '(*)' when she defines a method for '(+)'.
In specifying the semantics of type classes, I will state laws as follows:
(a + b) + c === a + (b + c)
The intended meaning is extensional equality:
The rest of the program should behave in the same way
if one side is replaced with the other.
Unfortunately, the laws are frequently violated by standard instances;
the law above, for instance, fails for
(1e20 + (-1e20)) + 1.0 = 1.0 1e20 + ((-1e20) + 1.0) = 0.0
For inexact number types like floating point types, thus these laws should be interpreted as guidelines rather than absolute rules. In particular, the compiler is not allowed to use them for optimization. Unless stated otherwise, default definitions should also be taken as laws.
Thanks to Brian Boutel, Joe English, William Lee Irwin II, Marcin Kowalczyk, Ketil Malde, Tom Schrijvers, Ken Shan, and Henning Thielemann for helpful comments.
Scope & Limitations/TODO: * It might be desireable to split Ord up into Poset and Ord (a total ordering). This is not addressed here.
In some cases, this hierarchy may not yet be fine-grained enough. For instance, time spans ("5 minutes") can be added to times ("12:34"), but two times are not addable. ("12:34 + 8:23") As it stands, users have to use a different operator for adding time spans to times than for adding two time spans. Similar issues arise for vector space et al. This is a consciously-made tradeoff, but might be changed. This becomes most serious when dealing with quantities with units like
length/distance^2, for which
(*)as defined here is useless. (One way to see the issue: should
f x y = iterate (x *) yhave principal type
(Ring.C a) => a -> a -> [a]or something like
(Ring.C a, Module a b) => a -> b -> [b]?)
I stuck with the Haskell 98 names. In some cases I find them lacking. Neglecting backwards compatibility, we have renamed classes as follows: Num --> Ring, Fractional --> Field, Floating --> Algebraic + Transcendental, RealFloat --> RealTranscendental,
It's slightly unfortunate that
abscan no longer be used for complex numbers, since it is standard mathematically.
magnitudeor more generally
Algebra.NormedSpace.Euclidean.normcan be used. But it had the wrong type before, and I couldn't see how to fit it in without complicating the hierarchy.
Additional standard libraries might include Enum, IEEEFloat (including the bulk of the functions in Haskell 98's RealFloat class), VectorSpace, Ratio, and Lattice.
|Versions||0.0.2, 0.0.4, 0.0.5, 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.3.1, 0.1.3.2, 0.1.3.3, 0.1.3.4, 0.2, 0.2.1, 0.2.2, 0.2.2.1, 0.3, 0.3.0.1, 0.3.0.2, 0.4, 0.4.0.1, 0.4.0.2, 0.4.0.3, 0.4.1, 0.4.2, 0.4.3|
|Dependencies||array (>=0.1 && <0.4), base (>=1.0 && <6), containers (>=0.1 && <0.4), gnuplot (==0.3.*), HTam (>=0.0.2 && <0.1), HUnit (==1.*), non-negative (>=0.0.2 && <0.1), parsec (>=1 && <4), QuickCheck (>=1 && <3), random (==1.0.*), storable-record (>=0.0.1 && <0.1), utility-ht (>=0.0.4 && <0.1) [details]|
|Author||Dylan Thurston <firstname.lastname@example.org>, Henning Thielemann <email@example.com>, Mikael Johansson|
|Maintainer||Henning Thielemann <firstname.lastname@example.org>|
|Source repo||this: darcs get http://code.haskell.org/numeric-prelude/ --tag 0.1.3.2
head: darcs get http://code.haskell.org/numeric-prelude/
|Uploaded||by HenningThielemann at Wed Feb 10 16:48:44 UTC 2010|
|Distributions||LTSHaskell:0.4.3, NixOS:0.4.3, Stackage:0.4.3, openSUSE:0.4.3|
|Executables||test-gaussian, testsuite, test|
|Downloads||9526 total (55 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by rule of succession]|
|Status||Docs not available [build log]
All reported builds failed as of 2016-12-30 [all 6 reports]
Hackage Matrix CI
Choose the new smaller, split-up base package.
Build test executables
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
For package maintainers and hackage trustees