Termination of abstract reduction systems

Authors:
Jeremy E. Dawson;Rajeev Goré
Affiliations:
Australian National University, Canberra, ACT, Australia;Australian National University, Canberra, ACT, Australia
Venue:
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Year:
2007

Citing 7
Cited 2

Proofs and types

Proofs and types
Natural termination

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
A Lambda-to-CL Translation for Strong Normalization

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Complete Monotonic Semantic Path Orderings

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Recursive path orderings can also be incremental

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

On Lazy Commutation

Languages: From Formal to Natural
Jumping and escaping: Modular termination and the abstract path ordering

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting proofs of termination for typed combinatory logic. Thus, our method can handle most path-orderings in the literature as well as the reducibility method typically used for typed combinators. Finally we show how our theorem can be used to prove termination for incrementally defined rewrite systems, including an incremental general path ordering. All proofs have been formally machine-checked in Isabelle/HOL.