# 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 | 0.0.1, 0.0.2, 0.0.2.1 |
---|---|

Dependencies | base (>=3.0 && <5.0), containers (==0.4.*) [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 Sun Oct 9 06:37:40 UTC 2011 |

Distributions | NixOS:0.0.2.1 |

Downloads | 1193 total (5 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 |

## Downloads

- monad-lrs-0.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)