There are many TransformationSystems available. This page contains an ordering of these systems by paradigm. *TermRewriting* Systems based on pure TermRewriting define a set of (conditional) equations over terms in an algebraic signature. * ASFandSDF * OBJ Term rewriting with RewritingStrategies * ELAN * Stratego.StrategoLanguage The transformation tools in XT are largely based on RewritingStrategies. Rewriting with reflection * MaudeSystem Bottom-up rewriting * BURG Other systems based on rewriting * TAMPR * MAG * [[DMSSoftwareReengineeringToolkit]] (full AC matching) *TreeRewriting* TreeRewriting is term rewriting extended to allow rewriting of arbtrary syntactic forms specified using a context-free grammar. * TXL (Tree Transformation Language) *GraphRewriting* * OPTIMIX *FunctionalTransformation* Using a functional language to implement transformations. * ElegantLanguage * TabalugaSystem * TXL (Tree Transformation Language) *ObjectOrientedTransformation* * SmalltalkRefactory * CompostFramework * JavaTreeBuilder * MemphisTreeWalker * [[Open cpp]] *Logic Programming* * LambdaProlog * TeyjusSystem *AttributeGrammar* * PumaLanguage * [[DMSSoftwareReengineeringToolkit]] * TXL (Tree Transformation Language) *AspectOrientedProgramming* * AspectJ *Procedural Transformation* * [[DMSSoftwareReengineeringToolkit]] *Other* The following systems have not been classified, yet. * ADATE * ASTLOG * CIP * DiSTiL * DoraTools * FermaT * FreshML * HaskellLanguage * HaXml * HATS * HOPS * IntentionalProgramming * JOIE * KHEPERA * KIDS * MAPTransformationSystem * MontagesFramework * NewJacc * OPTRAN * PropLanguage * PROSPECTRA * ReasoningSystem * RigiSystem * SpecWare * [[XDuce]]