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.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
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
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.2, 0.3 |
---|---|
Dependencies | base (<4.5) [details] |
License | BSD-3-Clause |
Author | Andres Loeh, Frank Huch, Jan Christiansen |
Maintainer | Jan Christiansen <jac@informatik.uni-kiel.de> |
Revised | Revision 1 made by HerbertValerioRiedel at 2017-11-17T14:15:20Z |
Category | Data, Math |
Home page | http://www-ps.informatik.uni-kiel.de/currywiki/tools/strictcheck |
Uploaded | by JanChristiansen at 2008-08-19T13:53:31Z |
Distributions | NixOS:0.3 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 3334 total (2 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] |