RTA 2014 - 25th International Conference on Rewriting Techniques and Applications (RTA)

The conference on Rewriting Techniques and Applications solicits oroginal papers on all aspects of rewriting, including (but not limited to):
Applications: case studies; rule-based programming; symbolic and algebraic computation; theorem proving; functional and logic programming; proof checking.
Foundations: matching and unification; completion techniques; strategies; constraint solving; explicit substitutions; tree automata.
Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; conditional rewriting; proof nets; categorical and infinitary rewriting.
Implementation: compilation techniques; parallel execution; rewriting tools.
Semantics: equational logic; rewriting logic.
In addition to full research papers, systems descriptions and problem sets that provide realistic, interesting challenges in the field of rewriting techniques are also welcome. High quality papers on applications of rewriting techniques are particularly encouraged.
The conference proceedings are published by Springer-Verlag as part of their Lecture Notes in Computer Science series.