On the equivalence of persistent term rewriting systems and recursive program schemes

The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs). In particular, recursive (applicative) program schemes (RPSs) considered as TRSs, are persistent. Two PTRSs R and R' are syntactically eq...

Full description

Saved in:
Bibliographic Details
Published in[1993] The 2nd Israel Symposium on Theory and Computing Systems pp. 240 - 249
Main Author Khasidashvili, Z.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1993
Subjects
Algebra
Programming profession
Online AccessGet full text

Cover

More Information
Summary:The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal term rewriting systems (OTRSs). In particular, recursive (applicative) program schemes (RPSs) considered as TRSs, are persistent. Two PTRSs R and R' are syntactically equivalent when any term t has an R-normal form if it has an R'-normal form and they coincide. He proves that syntactic equivalence is decidable for PTRSs. Further, he shows that the equivalence problem (over all continuous interpretations) is decidable for RPSs with unary basic functions by reducing the question to a decidable number-theory problem. Finally, he shows that weak and strong normalization and the reducibility problem also are decidable in PTRSs.< >
ISBN:0818636300
9780818636301
DOI:10.1109/ISTCS.1993.253465