Reduced Ground Term Rewrite Systems

Sándor Vágvölgyi · SSRN Electronic Journal · 2002

We show that for any equivalent reduced ground term rewrite systems and , the same number of terms appear as subterms in as in . We give an upper bound on the number of reduced ground term rewrite systems equivalent to a given reduced ground term rewrite system . We show that for any convergent ground term rewrite system , one can construct an equivalent reduced ground term rewrite system such that .

Read the paper · More papers on PaperTik