Evaluate and display 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.

prednote

prednote helps you build a tree of predicates that you can apply to a list of items. It was written for Penny:

http://www.github.com/massysett/penny

but I also find it useful for dapi:

http://www.github.com/massysett/dapi

and so you might find it useful too.

prednote is on Github:

http://www.github.com/massysett/prednote

and Hackage:

http://hackage.haskell.org/package/prednote

Test results

You can view the results of building and testing on Travis by clicking the button below:

If you have trouble building prednote due to dependency issues, try looking at the previous test results, as they will show you package versions that were used to build prednote successfully.

Something similar

See also rematch:

http://hackage.haskell.org/package/rematch

which is apparently based on a Java library called hamcrest.

License

prednote is licensed under the BSD license; see the LICENSE file.