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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Fernández, M. L., Godoy, G., & Rubio, A. (2005). Orderings for innermost termination. In Lecture Notes in Computer Science (Vol. 3467, pp. 17–31). Springer Verlag. https://doi.org/10.1007/978-3-540-32033-3_3
Mendeley helps you to discover research relevant for your work.