Normalization via Rewrite Closures

Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari

Abstract:
An abstract completion-based method for finding normal forms of terms with respect to certain term rewriting systems is presented. The procedure involves the use of a dictionary to keep information about the term structure and signatures. It gives a formulation for Chew's procedure for normalization by regular systems based on rewriting. The results are extended to performing normalization by arbitrary convergent systems.

Bibtex Entry:

@inproceedings{BRRT:RTA99,
author = {Leo Bachmair and  C. R. Ramakrishnan and  I. V. Ramakrishnan and  Ashish Tiwari},
title = {Normalization via Rewrite Closures},
booktitle = {Rewriting Techniques and Applications ({RTA})},
address = {Trento, Italy},
month = {July},
series = {Lecture Notes in Computer Science},
volume = {1631},
publisher = {Springer},
pages = {190--204},
year = {1999}
}

Full Paper: [pdf]

Home | Papers

C. R. Ramakrishnan
(cram@cs.sunysb.edu)