Completeness of Context-Sensitive Rewriting

Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete computations. Context-sensitive rewriting (csr) is the restriction of rewriting that only permits reductions on arguments selected by a replacement map μ, which associates a subset μ(f ) of argument indices with each function symbol f . Hendrix and Meseguer defined an algebraic semantics for Term Rewriting Systems (TRSs) executing csr that can be used to reason about programs written in programming languages like CafeOBJ and Maude, where such replacement restrictions can be specified in programs. Semantic completeness of csr was also defined. In this paper we show that canonical replacement maps, which play a prominent role in simulating rewriting computations with csr, are necessary for completeness in important classes of TRSs. © 2014 Elsevier B.V. All rights reserved.Supported by NSF CNS 13-19109, MINECO project TIN2010-21062-C02-02, GV (Generalitat Valenciana) Grants BEST/2014/026 and PROMETEO/2011/052.Lucas Alba, S. (2015). Completeness of Context-Sensitive Rewriting. Information Processing Letters. 115(2):87-92. https://doi.org/10.1016/j.ipl.2014.07.0048792115