Orderings for Innermost Termination

  • Mirtha-Lina Fernández
  • Guillem Godoy
  • Albert Rubio
Conference paper

DOI: 10.1007/978-3-540-32033-3_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3467)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mirtha-Lina Fernández
    • 1
  • Guillem Godoy
    • 2
  • Albert Rubio
    • 2
  1. 1.Universidad de OrienteSantiago de CubaCuba
  2. 2.Universitat Politècnica de CatalunyaBarcelonaEspaña

Personalised recommendations