Display program code

rationaltree.pl : Rational (finite and infinite) tree handler
Handler for equality and inequality constraints between terms based on generic strict total term order.

How to use:
Equality between terms A and B is written as A~B, inequality as A#~B, labeling is invoked by label.

See also:
M Meister, T Fruehwirth. Complexity of the CHR Rational Tree Equation Solver. Proceedings of the Third Workshop on Constraint Handling Rules, June 2006.

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007