Editing Graph rewriting (section)

===Term graph rewriting===
Another approach to graph rewriting is [[term graph]] rewriting, which involves the processing or transformation of term graphs (also known as ''abstract semantic graphs'') by a set of syntactic rewrite rules.

Term graphs are a prominent topic in programming language research since term graph rewriting rules are capable of formally expressing a compiler's [[operational semantics]]. Term graphs are also used as abstract machines capable of modelling chemical and biological computations as well as graphical calculi such as concurrency models. Term graphs can perform [[automated verification]] and logical programming since they are well-suited to representing quantified statements in first order logic. Symbolic programming software is another application for term graphs, which are capable of representing and performing computation with abstract algebraic structures such as groups, fields and rings.

The TERMGRAPH conference<ref>{{cite web |url=http://www.termgraph.org.uk/ |title=TERMGRAPH}}</ref> focuses entirely on research into term graph rewriting and its applications.