Jumping and escaping: Modular termination and the abstract path ordering

Nachum Dershowitz
2012 Theoretical Computer Science  
Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called "jumping", along with a weakened version of the lifting property, called "escaping" and requiring only an eventual lifting, are used for proving wellfoundedness of a generic, abstract version of the recursive path orderings. 1 These are the
more » ... malizing elements in R. The term "immortal" was sug-
doi:10.1016/j.tcs.2012.09.013 fatcat:eml7kpgvofaplbxqhbafyyhjn4