monad-lrs: a monad to calculate linear recursive sequence
A monad to calculate linear recursive sequence efficiently. Matrix multiplication and fast exponentiation algorithm are used to speed up calculating the number with particular index in the sequence. This library also provides a monadic DSL to describe the sequence.
|Versions [faq]||0.0.1, 0.0.2, 0.0.2.1|
|Dependencies||base (>=3.0 && <5.0), containers (>=0.4 && <0.6) [details]|
|Revised||Revision 1 made by BinJin at 2014-08-13T17:45:00Z|
|Uploaded||by BinJin at 2012-03-04T13:50:51Z|
|Downloads||2068 total (50 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
- monad-lrs-0.0.2.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees