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.
[Skip to Readme]
Modules
[Index]
Downloads
- prednote-0.22.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.5.0.0 && <5), contravariant (>=0.2.0.1), rainbow (>=0.6.0.4), split (>=0.2.2), text (>=0.11.2.0) [details] |
License | BSD-3-Clause |
Copyright | 2013-2014 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 2014-03-02T01:55:45Z |
Distributions | |
Reverse Dependencies | 5 direct, 0 indirect [details] |
Downloads | 20800 total (74 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Successful builds reported [all 1 reports] |