Context-sensitive rewriting is a simple rewriting restriction which is formalized by imposing
fixed restrictions on replacements. Such a restriction is given on a purely syntactic basis: it is …

Abstract Reasoning about the termination of equational programs in sophisticated
equational languages such as Elan, Maude, OBJ, CafeOBJ, Haskell, and so on, requires …

Context-sensitive rewriting is a restriction of term rewriting where reductions are allowed on
specific arguments of function symbols only, and then in particular positions of terms …

Context-sensitive rewriting is a computational restriction of term rewriting used to model non-
strict (lazy) evaluation in functional programming. The goal of this paper is the study and …

Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed
inside some fixed arguments of some function symbols. We introduce two new techniques …

Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite
sequences issued from every term. Context-sensitive rewriting (CSR) is an example of such …

Advanced ty**, matching, and evaluation strategy features, as well as very general
conditional rules, are routinely used in equational programming languages such as, for …

Termination is one of the most interesting problems when dealing with context-sensitive
rewrite systems. Although a good number of techniques for proving termination of context …

We investigate termination of rewriting computations guided by strategy annotations. We
show that proofs of termination can be obtained by proving (innermost) termination of …

Declarative languages such as OBJ, CafeOBJ, and Maude use syntactic annotations to
introduce replacement restrictions aimed at improving termination or efficiency of …