Orderings for Innermost Termination
- Cite this paper as:
- Fernández ML., Godoy G., Rubio A. (2005) Orderings for Innermost Termination. In: Giesl J. (eds) Term Rewriting and Applications. RTA 2005. Lecture Notes in Computer Science, vol 3467. Springer, Berlin, Heidelberg
This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for proving innermost termination of non-terminating term rewrite systems.
Unable to display preview. Download preview PDF.