Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
