Abstract
We re-express our theorem on the strong-normalisation of display calculi as a theorem about the well-foundedness of a certain ordering on first-order terms, thereby allowing us to prove the termination of systems of rewrite rules. We first show how to use our theorem to prove the well-foundedness of the lexicographic ordering, the multiset ordering and the recursive path ordering. Next, we give examples of systems of rewrite rules which cannot be handled by these methods but which can be handled by ours. Finally, we show that our method can also prove the termination of the Knuth-Bendix ordering and of dependency pairs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)
Borralleras, C., Ferreira, M., Rubio, A.: Complete Monotonic Semantic Path Orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 346–364. Springer, Heidelberg (2000)
Dawson, J.E., Goré, R.: A New Machine-checked Proof of Strong Normalisation for Display Logic. In: Computing: The Australasian Theory Symposium. Electronic Notes in Theoretical Computer Science, vol. 78, pp. 16–35. Elsevier, Amsterdam (2003)
Dawson, J.E., Goré, R.: Formalised cut admissibility for display logic. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 131–147. Springer, Heidelberg (2002)
Dershowitz, N.: 33 Examples of Termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, pp. 16–25. Springer, Heidelberg (1995)
Dershowitz, N., Hoot, C.: Natural Termination. Theoretical Computer Science 142, 179–207 (1995)
Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 535–610. Elsevier, Amsterdam (2001)
Doornbos, H., Von Karger, B.: On the Union ofWell-Founded Relations. L. J. of the IGPL 6, 195–201 (1998)
Ferreira, M.C.F., Zantema, H.: Well-foundedness of Term Orderings. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 106–123. Springer, Heidelberg (1995)
Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 484–497. Springer, Heidelberg (2001)
Kamin, S., Lévy, J.-J.: Two generalizations of the recursive path ordering. Unpublished, Department of Computer Science, University of Illinois (1980)
Pfenning, F.: Structural Cut Elimination. In: Proc. LICS 1994 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawson, J.E., Goré, R. (2004). A General Theorem on Termination of Rewriting. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive