The prednote package

[Tags: bsd3, library]

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.

tests are packaged separately in the prednote-tests package.


Properties

Versions0.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
Dependenciesbase (>=4.5.0.0 && <5), containers (>=0.4.2.1 && <0.6), contravariant (>=0.2.0.1 && <0.7), rainbow (>=0.18.0.0 && <0.19), split (>=0.2.2 && <0.3), text (>=0.11.2.0 && <1.2)
LicenseBSD3
CopyrightCopyright 2013-2014 Omari Norman
AuthorOmari Norman
Maintaineromari@smileystation.com
StabilityExperimental
CategoryData
Home pagehttp://www.github.com/massysett/prednote
Bug trackerhttp://www.github.com/massysett/prednote/issues
Source repositoryhead: git clone git://github.com/massysett/prednote.git -b master
UploadedMon Oct 27 16:46:48 UTC 2014 by OmariNorman
Downloads1361 total (111 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees