Functions for finding prime numbers, checking whether a number is prime, finding the factors of a number etc.
Version 0.2.1

This package includes the Sieve of O'Neill and two generalizations of the Sieve of Eratosthenes. The Sieve of O'Neill is a fully incremental primality sieve based on priority queues. The other two are array based, and are not incremental. One sieves the smallest prime factor, and is useful if you want to factor a large quantity of small numbers. The other sieves Euler's Totient, which is the number of positive integers relatively prime and less than a given number.
Version 0.1.2

Instances of numeric classes for functions and tuples. Import Data.NumInstances to get all the instances. If you want only function or only tuple instances, import Data.NumInstances.Function or Data.NumInstances.Tuple.
Version 1.3

Num, Enum, Eq, Integral, Ord, Real, and Show instances for Lazy ByteStrings
Version 0.0.0.1

> 2

Combinators for creating bijections from a subset of an arbitrary type to a range of Ints, , e.g. for using libraries that require Int IDs.
Version 0.2.1

Instances of the numerical classes for a variety of different numbers: (computable) real numbers, arbitrary precision fixed numbers, arbitrary precision floating point numbers, differentiable numbers, symbolic numbers, natural numbers, interval arithmetic.
Version 3000.2.0.0

Contains the number of entries in the colormap of the *current window*'s current layer (0 in RGBA mode).

Contains Just the number of dials and buttons of an attached dial & button box or Nothing if there is none.

the current number of discarded tests

Convert numbers to number words in a number of languages. Each language has its own module. The module name is based on one of the ISO 639 Alpha codes. Each module contains one or more cardinal functions and a struct function. The cardinal functions directly convert cardinal numbers to a string-like representation of their spoken form. The struct functions convert numbers to a polymorphic representation of their grammatical structure. All language modules are implemented using the numerals-base package.
The use of this package is best understood with some examples. Because the results of conversion are polymorphic we need to choose a specific type. For these examples we'll use simple strings. But any type that has instances for Monoid and IsString will work. First some English number names, both British and US variants:
>>> import qualified Text.Numeral.Language.EN as EN >>> EN.uk_cardinal 123 :: Maybe String Just "one hundred and twenty-three" >>> EN.us_cardinal (10^50 + 42) :: Maybe String Just "one hundred quindecillion forty-two"
French, which contains some traces of a base 20 system:
>>> import qualified Text.Numeral.Language.FR as FR >>> FR.cardinal (-99) :: Maybe String Just "moins quatre-vingt-dix-neuf"
Conversions can fail. Alamblak, a language spoken by a few people in Papua New Guinea, has no representation for negative numbers:
>>> import qualified Text.Numeral.Language.AMP as AMP >>> AMP.cardinal (-3) :: Maybe String Nothing
Some languages have multiple scripts and methods for writing number names. Take Chinese for example, which can be written using Han characters or transcribed to the Latin script using Pinyin.
Traditional Chinese characters:
>>> import qualified Text.Numeral.Language.ZH as ZH >>> ZH.trad_cardinal 123456 :: Maybe String Just "AŒ, CÛ~”Am"
Simplified characters for use in financial contexts:
>>> ZH.finance_simpl_cardinal 123456 :: Maybe String Just "þ0Âß†/
þF"
Transcribed using Pinyin:
>>> ZH.pinyin_cardinal 123456 :: Maybe String Just "shíèrwàn snqin sìbÎi wÔshí liù"
Using the struct functions you can see the grammatical structure of number names. Because the results of these functions are polymorphic you need to specify a specific type.
>>> import qualified Text.Numeral.Language.NL as NL >>> NL.struct 123 :: Maybe Integer Just 123 >>> import Text.Numeral >>> NL.struct 123 :: Maybe Exp Just (Add (Lit 100) (Add (Lit 3) (Mul (Lit 2) (Lit 10))))
Compare with:
>>> NL.cardinal 123 :: Maybe String Just "honderddrieëntwintig"
100 (honderd) + (3 (drie) + (ën) 2 (twin) * 10 (tig))
Version 0.3.0.1

This package contains machinery to construct functions that convert numbers to number words. It allows you to write a function which converts a number like 142 to the string "one hundred and forty-two".
The documentation for the Text.Numeral module contains an high level overview of the package.
If you just want to convert numbers to number words in a specific language you should probably use the numerals package. That package also contains numerous examples on how to use the functions in this package.
Version 0.3

Various floating point limit related constants.
Version 0.1.0.0