monad-lrs: a monad to calculate linear recursive sequence

[ bsd3, deprecated, library, math ] [ Propose Tags ]

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.




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'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.0.1, 0.0.2,
Dependencies base (>=3.0 && <5.0), containers (>=0.4 && <0.6) [details]
License BSD-3-Clause
Author Bin Jin
Revised Revision 1 made by BinJin at 2014-08-13T17:45:00Z
Category Math
Home page
Bug tracker
Uploaded by BinJin at 2012-03-04T13:50:51Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2494 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]