Invariants and closures in the theory of rewrite systems
Stefan Rönn · Formal Aspects of Computing · 1996
Abstract The article investigates some useful concepts of rewrite systems, especially invariants and closures. The concepts are formalised with so-called string expressions, for which an axiomatisation is given. The central operator in the theory of rewrite systems, the rewrite operator, is introduced with formulas that permit a calculational approach. The connections with distributed programming are also explained.