Title
Orderings for Innermost Termination
Abstract
This paper shows that the suitable orderings for proving in- nermost termination are characterized by the innermost parallel mono- tonicity, IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Re- cursive 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.
Year
DOI
Venue
2005
10.1007/978-3-540-32033-3_3
Rewriting Techniques and Applications
Keywords
DocType
Volume
ip-monotonic version,recursive path ordering,innermost parallel monotonicity,innermost termination,dependency pairs method,suitable ordering,innermost-specific ordering,non-terminating term
Conference
3467
ISSN
ISBN
Citations 
0302-9743
3-540-25596-6
4
PageRank 
References 
Authors
0.39
14
3
Name
Order
Citations
PageRank
Mirtha-Lina Fernández1885.38
Guillem Godoy222021.72
Albert Rubio322819.44