# The monad-lrs package

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.

- No changelog available

## Properties

Versions | 0.0.1, 0.0.2, 0.0.2.1 |
---|---|

Dependencies | base (>=3.0 && <5.0), containers (==0.4.*) |

License | BSD3 |

Author | Bin Jin |

Maintainer | bjin1990+haskell@gmail.com |

Stability | experimental |

Category | Math |

Home page | https://github.com/bjin/monad-lrs |

Bug tracker | https://github.com/bjin/monad-lrs/issues |

Uploaded | Mon Sep 26 07:39:00 UTC 2011 by BinJin |

Distributions | NixOS:0.0.2.1 |

Downloads | 309 total (31 in last 30 days) |

Status | Docs uploaded by user Build status unknown [no reports yet] |

## Modules

*Math**LinearRecursive*

[Index]

## Downloads

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

#### Maintainers' corner

For package maintainers and hackage trustees