monad-lrs: a monad to calculate linear recursive sequence

[ bsd3, 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.

Versions 0.0.1, 0.0.2, 0.0.2.1
Dependencies base (>=3.0 && <5.0), containers (>=0.4 && <0.6) [details]
License BSD-3-Clause
Author Bin Jin
Maintainer bjin1990+haskell@gmail.com
Revised Revision 1 made by BinJin at Wed Aug 13 17:45:00 UTC 2014
Category Math
Home page https://github.com/bjin/monad-lrs
Bug tracker https://github.com/bjin/monad-lrs/issues
Uploaded by BinJin at Sun Mar 4 13:50:51 UTC 2012
Distributions NixOS:0.0.2.1
Downloads 1263 total (43 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

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

For package maintainers and hackage trustees