monad-lrs: a monad to calculate linear recursive sequence

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

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.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.1, 0.0.2, 0.0.2.1
Dependencies base (>=3.0 && <5.0), containers (>=0.4 && <0.5) [details]
License BSD-3-Clause
Author Bin Jin
Maintainer bjin1990+haskell@gmail.com
Category Math
Home page https://github.com/bjin/monad-lrs
Bug tracker https://github.com/bjin/monad-lrs/issues
Uploaded by BinJin at 2011-10-09T06:37:40Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2477 total (6 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]