Lazy Rewriting and Context-Sensitive Rewriting

Abstract Lazy rewriting ( LR ) is intended to improve the termination behavior of TRSs. This is attempted by restricting reductions for selected arguments of functions. Similarly, context-sensitive rewriting ( CSR ) forbids any reduction on those arguments. We show that LR and CSR coincide under certain conditions. On the basis of this result, we also describe a transformation which permits us to prove termination of LR as termination of CSR for the transformed system. Since there are a number of different techniques for proving termination of CSR , this provides a formal framework for proving termination of lazy rewriting.

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

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

[3]  Quang Huy Nguyen.  Compact Normalisation Trace via Lazy Rewriting , 2001, Electron. Notes Theor. Comput. Sci..

[4]  Joseph A. Goguen,et al.  Software Engineering with Obj: Algebraic Specification In Action , 2010 .

[5]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[6]  Salvador Lucas,et al.  Modular termination of context-sensitive rewriting , 2002, PPDP '02.

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

[8]  Salvador Lucas.  Termination of Rewriting With Strategy Annotations , 2001, LPAR.

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

[10]  Salvador Lucas,et al.  Recursive Path Orderings Can Be Context-Sensitive , 2002, CADE.

[11]  Salvador Lucas.  Termination of (Canonical) Context-Sensitive Rewriting , 2002, RTA.

[12]  S. Antoy.  Deenitional Trees , 1992 .

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

[14]  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.

[15]  Salvador Lucas.  Context-sensitive rewriting strategies , 2002 .

[16]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[19]  Jürgen Giesl,et al.  Transformation techniques for context-sensitive rewrite systems , 2004, J. Funct. Program..

[20]  Salvador Lucas,et al.  Termination of on-demand rewriting and termination of OBJ programs , 2001, PPDP '01.

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

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

[23]  Salvador Lucas,et al.  Strongly Sequential and Inductively Sequential Term Rewriting Systems , 1998, Inf. Process. Lett..

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

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

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

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

[28]  Sergio Antoy.  Definitional Trees , 1992, ALP.