Title :
A theory of using history for equational systems with applications
Author :
Verma, Rakesh M.
Author_Institution :
Dept. of Comput. Sci., Houston Univ., TX, USA
Abstract :
A general theory of using a congruence closure based simplifier (CCNS) proposed by P. Chew (1980) for computing normal forms is developed, and several applications are presented. An independent set of postulates is given, and it is proved that CCNS can be used for any system that satisfies them. It is then shown that CCNS can be used for consistent convergent systems and for various kinds of priority rewrite systems. A simple translation scheme for converting priority systems into effectively nonoverlapping convergent systems is presented
Keywords :
rewriting systems; congruence closure based simplifier; consistent convergent systems; equational systems; normal forms; priority rewrite systems; translation scheme; Application software; Computer languages; Computer science; Data structures; Databases; Equations; History; Mathematics;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185390
