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 |
|---|---|
| Dependencies | base |
| License | BSD3 |
| Author | Andres Loeh, Frank Huch, Jan Christiansen |
| Maintainer | Jan Christiansen <jac@informatik.uni-kiel.de> |
| Stability | alpha |
| Category | Data, Math |
| Home page | http://www-ps.informatik.uni-kiel.de/currywiki/tools/strictcheck |
| Upload date | Tue Aug 19 13:53:31 UTC 2008 |
| Uploaded by | JanChristiansen |
| Built on | ghc-6.10, ghc-6.8 |
Modules
Downloads
- nat-0.2.tar.gz (Cabal source package)
- package description (included in the package)