Abstract
Methods of proving that a term-rewriting system terminates are presented. They are based on the intuitive notion of ‘simplification orderings’, orderings in which any term that is syntactically simpler than another is smaller than the other. As a consequence of Kruskal's Tree Theorem, any nonterminating system must be self-embedding in the sense that it allows for the derivation of some term from a simpler one; thus termination is guaranteed if every rule in the system is a reduction in some simplification ordering. Most of the orderings that have been used for proving termination are indeed simplication orderings; using this notion often allows for much easier proofs. A particularly useful class of simplification orderings, the ‘recursive path orderings’, is defined. Examples of the use of simplication orderings in termination proofs are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
