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.
|Versions||0.1, 0.2, 0.3|
|Dependencies||base (<4.5) [details]|
|Author||Andres Loeh, Frank Huch, Jan Christiansen|
|Maintainer||Jan Christiansen <firstname.lastname@example.org>|
|Revised||Revision 1 made by HerbertValerioRiedel at Fri Nov 17 14:15:20 UTC 2017|
|Uploaded||by JanChristiansen at Tue Aug 19 13:53:31 UTC 2008|
|Downloads||1602 total (7 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
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'.
For package maintainers and hackage trustees