Abstract
To simplify the task of proving termination of term rewriting systems, several elimination methods, such as the dummy elimination, the distribution elimination, the general dummy elimination and the improved general dummy elimination, have been proposed. In this paper, we show that the argument filtering method combining with the dependency pair technique is essential in all the above elimination methods. We present remarkable simple proofs for the soundness of these elimination methods based on this observation. Moreover, we propose a new elimination method, called the argument filtering transformation, which is not only more powerful than all the other elimination methods but also especially useful to make clear the essential relation hidden behind these methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arts, T.: Automatically Proving Termination and Innermost Normalization of Term Rewriting Systems, PhD thesis, Utrecht University (1997)
Arts, T., Giesl, J.: Automatically Proving Termination where Simplification Orderings Fail. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 261–272. Springer, Heidelberg (1997)
Arts, T., Giesl, J.: Proving Innermost Normalization Automatically. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 157–171. Springer, Heidelberg (1997)
Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. To appear in Theoretical Computer Science
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Ferreira, M., Zantema, H.: Dummy Elimination: Making Termination Easier. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 243–252. Springer, Heidelberg (1995)
Ferreira, M.: Termination of Term Rewriting, Well-foundedness, Totality and Trans- formations, PhD thesis, Utrecht University (1995)
Giesl, J., Ohlebusch, E.: Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. In: Proceedings of the Second International Workshop on Frontiers of Combining Systems, FroCos 1998, Amsterdam, The Nether- lands, October 1998. Applied Logic Series (1998)
Klop, J.W.: Term Rewriting Systems. Handbook of Logic in Computer Science II, pp. 1–112. Oxford University Press, Oxford (1992)
Kusakari, K., Toyama, Y.: On Proving AC-Termination by AC-Dependency Pairs, Research Report IS-RR-98-0026F, School of Information Science, JAIST (1998)
Kusakari, K., Toyama, Y.: The Hierarchy of Dependency Pairs, Research Report IS-RR-99-0007F, School of Information Science, JAIST (1999)
Kusakari, K., Nakamura, M., Toyama, Y.: Argument Filtering Transformation, Research Report IS-RR-99-0008F, School of Information Science, JAIST (1999)
Middeldorp, A., Ohsaki, H., Zantema, H.: Transforming Termination by Self-Labelling. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 373–387. Springer, Heidelberg (1996)
Marche, C., Urbain, X.: Termination of Associative-Commutative Rewriting by Dependency Pairs. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 241–255. Springer, Heidelberg (1998)
Nakamura, M., Kusakari, K., Toyama, Y.: On Proving Termination by General Dummy Elimination. To appear in Trans. of IEICE (in Japanese)
Zantema, H.: Termination of Term Rewriting: Interpretation and Type Elimination. Journal of Symbolic Computation 17, 23–50 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kusakari, K., Nakamura, M., Toyama, Y. (1999). Argument Filtering Transformation. In: Nadathur, G. (eds) Principles and Practice of Declarative Programming. PPDP 1999. Lecture Notes in Computer Science, vol 1702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704567_3
Download citation
DOI: https://doi.org/10.1007/10704567_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66540-3
Online ISBN: 978-3-540-48164-5
eBook Packages: Springer Book Archive