The statistics package

[ Tags: bsd2, library, math, statistics ] [ Propose Tags ]

This library provides a number of common functions and types useful in statistics. Our focus is on high performance, numerical robustness, and use of good algorithms. Where possible, we provide references to the statistical literature.

The library's facilities can be divided into three broad categories:

Working with widely used discrete and continuous probability distributions. (There are dozens of exotic distributions in use; we focus on the most common.)

Computing with sample data: quantile estimation, kernel density estimation, bootstrap methods, and autocorrelation analysis.

Random variate generation under several different distributions.

[Skip to Readme]


Versions 0.1, 0.2, 0.2.1, 0.2.2, 0.3, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.3.6, 0.4.0, 0.4.1,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Dependencies base (<5), erf, time, uvector (>=, uvector-algorithms (>=0.2) [details]
License BSD3
Copyright 2009 Bryan O'Sullivan
Author Bryan O'Sullivan <>
Maintainer Bryan O'Sullivan <>
Category Math, Statistics
Home page
Uploaded Sat Sep 19 05:17:22 UTC 2009 by BryanOSullivan
Distributions Arch:, Debian:, FreeBSD:, LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 41082 total (2041 in the last 30 days)
Rating 2.0 (1 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for statistics-0.3.1

[back to package description]
Statistics: efficient, general purpose statistics

This package provides the Statistics module, a Haskell library for
working with statistical data in a space- and time-efficient way.

Where possible, we give citations and computational complexity
estimates for the algorithms used.


This library has been carefully optimised for high performance.  To
obtain the best runtime efficiency, it is imperative to compile
libraries and applications that use this library using a high level of

Suggested GHC options:

  -O -fvia-C -funbox-strict-fields

To illustrate, here are the times (in seconds) to generate and sum 250
million random Word32 values, on a laptop with a 2.4GHz Core2 Duo
P8600 processor, running Fedora 11 and GHC 6.10.3:

  no flags   200+
  -O           1.249
  -O -fvia-C   0.991

As the numbers above suggest, compiling without optimisation will
yield unacceptable performance.

Get involved!

Please feel welcome to contribute new code or bug fixes.  You can
fetch the source repository from here:

darcs get


Bryan O'Sullivan <>