Termination of on-demand rewriting and termination of OBJ programs

Declarative languages such as OBJ, CafeOBJ, and Maude use syntactic annotations to introduce replacement restrictions aimed at improving termination or efficiency of computations. Unfortunately, there is a lack of formal techniques for proving such benefits. We show that context-sensitive rewriting and on-demand rewriting provide a suitable framework to address this problem. We provide methods to analyze termination of on-demand rewriting and apply them to analyze termination of OBJ, CafeOBJ, and Maude programs.

[1]  José Meseguer,et al.  Principles of OBJ2 , 1985, POPL.

[2]  H. R. Walters,et al.  Lazy Rewriting and Eager Machinery , 1995, RTA.

[3]  M. Clavel,et al.  Principles of Maude , 1996, WRLA.

[4]  Salvador Lucas,et al.  Termination of Context-Sensitive Rewriting by Rewriting , 1996, ICALP.

[5]  Ataru T. Nakagawa,et al.  An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks , 1997, First IEEE International Conference on Formal Engineering Methods.

[6]  Hans Zantema,et al.  Termination of Context-Sensitive Rewriting , 1997, RTA.

[7]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[8]  Salvador Lucas,et al.  Context-sensitive Computations in Functional and Functional Logic Programs , 1998, J. Funct. Log. Program..

[9]  Steven Eker.  Term rewriting with operator evaluation strategies , 1998, WRLA.

[10]  Maria C. F. Ferreira,et al.  Context-Sensitive AC-Rewriting , 1999, RTA.

[11]  長谷 崇.  Reduction strategies for term rewriting systems , 1999 .

[12]  Jürgen Giesl,et al.  Transforming Context-Sensitive Rewrite Systems , 1999, RTA.

[13]  Wan Fokkink,et al.  Lazy rewriting on eager machinery , 2000, TOPL.

[14]  Kazuhiro Ogata,et al.  The evaluation strategy for head normal form with and without on-demand flags , 2000, WRLA.

[15]  Kazuhiro Ogata,et al.  Operational semantics of rewriting with the on-demand evaluation strategy , 2000, SAC '00.

[16]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[17]  Salvador Lucas,et al.  Context-Sensitive Rewriting Strategies , 2002, Inf. Comput..

[18]  N. A C H U M D E R S H O W I T Z.  Termination of Rewriting' , 2022 .