nat: Lazy binary natural numbers
Implementation of natural numbers and integers by a binary representation. All functions are supposed to be as non-strict as possible. Furthermore the implementation is supposed to be reasonable efficient (in comparison to peano numbers). This implementation is inspired by a similar approach in the functional logic programming language Curry.
Downloads
- nat-0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.2, 0.3 |
---|---|
Dependencies | base (>=4 && <5) [details] |
License | BSD-3-Clause |
Author | Jan Christiansen |
Maintainer | Jan Christiansen <info@monoid-it.de> |
Category | Data, Math |
Bug tracker | https://github.com/plancalculus/nat/issues |
Source repo | head: git clone https://github.com/plancalculus/nat.git |
Uploaded | by JanChristiansen at 2012-08-13T11:51:30Z |
Distributions | NixOS:0.3 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 3281 total (13 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] |