Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-91-209

Associative-commutative reduction orderings

Bachmair, Leo

MPI-I-91-209. November 1991, 7 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Rewrite systems are sets of directed equations used to compute by repeatedly replacing subterms in a given expression by equal terms until a simplest form possible (a normal form) is obtained.
If a rewrite system is terminating (i.e., allows no infinite sequence of rewrites), then every expression has a normal form. A variety of orderings, called reduction orderings, have been designed to prove termination of rewrite sytems, but most of them are not applicable to extended rewrite systems, where rewrites may take into account inherent properties of given functions such as associativity and commutativity.
In this paper we show how an ordering represented as a schematic rewrite system---the lexicographic path ordering---can be systematically modified into an ordering compatible with associativity and commutativity.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-91-209.pdfMPI-I-91-209.pdfMPI-I-91-209.dvi35 KBytes; 98 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1991-209
Hide details for BibTeXBibTeX
@TECHREPORT{Bachmair91,
  AUTHOR = {Bachmair, Leo},
  TITLE = {Associative-commutative reduction orderings},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-91-209},
  MONTH = {November},
  YEAR = {1991},
  ISSN = {0946-011X},
}