M. Iwami (Japan)
: Model-based reasoning, Term rewriting sys tem, Termination, Persistence
A property P is called persistent if for any many-sorted term rewriting system R, R has the property P if and only if term rewriting system (R), which results from R by omitting its sort information, has the property P. In this paper, we show that termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that termination is modular for right-linear overlay term rewriting systems.
Important Links:
Go Back
