TermRewriting
Systems based on pure TermRewriting define a set of (conditional) equations over terms in an algebraic signature.
Term rewriting with RewritingStrategies
The transformation tools in XT are largely based on RewritingStrategies.
Rewriting with reflection
Bottom-up rewriting
Other systems based on rewriting
TreeRewriting
TreeRewriting is term rewriting extended to allow rewriting of arbtrary syntactic forms specified using a context-free grammar.
GraphRewriting
FunctionalTransformation
Using a functional language to implement transformations.
ObjectOrientedTransformation
Logic Programming
AttributeGrammar
AspectOrientedProgramming
Procedural Transformation
Other
The following systems have not been classified, yet.