RISC RISC Research Institute for Symbolic Computation  

Context & Sequence Matching for Unranked Terms

This is a Java implementation of the algorithm M described in:

Part of the Library of Unification and Anti-Unification Algorithms.

Input Syntax:
Matching problem:
(Use the semicolon to separate
the equations of the system.)
Justify computed matchers:
Output format:


This software is released under the GNU Lesser General Public License ("LGPL"). For presentation purpose, the Java source code has been translated into JavaScript by the GWT compiler.
Some examples (click on them to prepared the input form):

  • C(f(X)) << g(f(a,b),h(f(a),f))
  • C(G(X)) << f(f(a,b),c))
  • f(X, x, Y) << f(f(a), b, a, b)

Author: Alexander Baumgartner FWF Der Wissenschaftsfond
Project: SToUT - Symbolic Computation Techniques for Unranked Terms