prednote: Build and evaluate trees of predicates
Build and evaluate trees of predicates. For example, you might build a predicate of the type Int -> Bool. You do this by assembling several predicates into a tree. You can then verbosely evaluate this tree, showing why a particular result is reached.
prednote also provides modules to test several subjects against a given predicate, and to parse infix or RPN expressions into a tree of predicates.
Modules
[Index]
Downloads
- prednote-0.10.0.0.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.2.0.0, 0.4.0.0, 0.6.0.0, 0.8.0.0, 0.10.0.0, 0.12.0.0, 0.14.0.0, 0.16.0.0, 0.18.0.0, 0.18.0.4, 0.20.0.0, 0.22.0.0, 0.22.0.2, 0.24.0.0, 0.24.2.0, 0.26.0.0, 0.26.0.2, 0.26.0.4, 0.28.0.0, 0.28.0.2, 0.30.0.0, 0.32.0.0, 0.32.0.4, 0.32.0.6, 0.34.0.0, 0.36.0.0, 0.36.0.2, 0.36.0.4 |
|---|---|
| Dependencies | base (>=4.6 && <5), explicit-exception (>=0.1 && <0.2), rainbow (>=0.4 && <0.5), split (>=0.2 && <0.3), text (>=0.11 && <0.12) [details] |
| License | BSD-3-Clause |
| Copyright | 2013 Omari Norman |
| Author | Omari Norman |
| Maintainer | omari@smileystation.com |
| Category | Data |
| Home page | http://github.com/massysett/prednote |
| Source repo | head: git clone git://github.com/massysett/prednote.git |
| Uploaded | by OmariNorman at 2013-06-29T14:48:57Z |
| Distributions | |
| Reverse Dependencies | 5 direct, 0 indirect [details] |
| Downloads | 20469 total (62 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] |