combinatorial: Count, enumerate, rank and unrank combinatorial objects

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


Counting, enumerating, ranking and unranking of combinatorial objects. Well-known and less well-known basic combinatoric problems and examples.

The functions are not implemented in obviously stupid ways, but they are also not optimized to the maximum extent. The package is plain Haskell 98.

See also:


Versions0.0, 0.0, 0.1
Dependenciesarray (>=0.4 && <0.6), base (>=4.5 && <5), containers (>=0.4.2 && <0.6), transformers (>=0.3 && <0.6), utility-ht (>=0.0.8 && <0.13) [details]
AuthorHenning Thielemann <>
MaintainerHenning Thielemann <>
CategoryMath, Statistics
Home page
Source repositorythis: darcs clone --tag 0.0
head: darcs clone
UploadedSat Dec 16 11:32:23 UTC 2017 by HenningThielemann




Maintainers' corner

For package maintainers and hackage trustees