Article

Free access

Termination of abstract reduction systems

Authors:

Jeremy E. Dawson,

Rajeev GoréAuthors Info & Claims

CATS '07: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65

Pages 35 - 43

Published: 30 January 2007 Publication History

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.

References

[1]

Yohji Akama. A λ-to-CL Translation for Strong Normalization. In Proc. Typed Lambda Calculi and Applications (TLCA'97), LNCS 1210, 1--10, Springer, 1997.

Digital Library

[2]

Thomas Arts and Jürgen Giesl. Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236 (2000), 133--178, 2000.

Digital Library

[3]

Franz Baader and Tobias Nipkow. Term Rewriting and All That. CUP, 1998

Digital Library

[4]

C Borralleras, M Ferreira and A Rubio. Complete Monotonic Semantic Path Orderings. In Proc. CADE-17, LNCS 1831, 346--364, Springer, 2000.

Digital Library

[5]

Wilfried Buchholz. Proof-theoretic analysis of termination proofs. Annals of Pure and Applied Logic 75 (1995), 57--65.

[6]

Jeremy E Dawson and Rajeev Goré. A General Theorem on Termination of Rewriting. In Proc. Computer Science Logic (CSL 2004), LNCS 3210, 100--114, 2004.

[7]

J E Dawson and R Goré. Machine-checked Termination Proofs for Abstract Reduction Systems. In preparation.

[8]

J E Dawson. Isabelle/HOL code, http://web.rsise.anu.edu.au/~jeremy/isabelle

[9]

N Dershowitz. Termination Dependencies (Extended Abstract). In Proc. Sixth Int'l Workshop on Termination (WST '03), A Rubio, ed., Valencia, Spain, pp. 27--30.

[10]

N Dershowitz & C Hoot. Natural Termination. TCS 142 (1995), 179--207.

Digital Library

[11]

Henk Doornbos & Burghard Von Karger. On the Union of Well-Founded Relations. L. J. of the IGPL 6 (1998), 195--201.

[12]

Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio. Recursive Path Orderings Can Also Be Incremental. Proc. LPAR2005, LNCS 3835, 230--245, Springer, 2005.

Digital Library

[13]

Jean-Yves Girard, Yves Lafont and Paul Taylor. Proofs and Types. CUP, 1990.

Digital Library

[14]

J Goubault-Larrecq. Well-founded recursive relations. In Proc. CSL'2001, LNCS 2142, 484--497, Springer, 2001.

Digital Library

[15]

Nao Hirokawa and Aart Middeldorp. Dependency Pairs Revisited. In Proc. Rewriting Techniques and Applications (RTA-04), LNCS 3091, 249--268, Springer, 2004.

Index Terms

Termination of abstract reduction systems

Index terms have been assigned to the content through auto-classification.

Recommendations

Termination of rewrite relations on λ-terms based on Girard's notion of reducibility

In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination of various kinds of rewrite relations on λ-terms, including rewriting ...
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

We investigate restricted termination and confluence properties of term rewriting systems, in particular weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, and their interrelations. New criteria are ...
Proving termination of context-sensitive rewriting by transformation

Context-sensitive rewriting (CSR) is a restriction of rewriting that forbids reductions on selected arguments of functions. With CSR, we can achieve a terminating behavior with non-terminating term rewriting systems, by pruning (all) infinite rewrite ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

CATS '07: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65

January 2007

153 pages

ISBN:1920682465

Publisher

Australian Computer Society, Inc.

Australia

Publication History

Published: 30 January 2007

Author Tags

Qualifiers

Article

Conference

CATS '07

CATS '07: Theory of computing

January 30 - February 2, 2007

Victoria, Ballarat, Australia

Acceptance Rates

Overall Acceptance Rate 118 of 228 submissions, 52%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
130
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)7

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten