Applications and extensions of context-sensitive rewriting

Abstract

Context-sensitive rewriting is a restriction of term rewriting which is obtained by imposing replacement restrictions on the arguments of function symbols. It has proven useful to analyze computational properties of programs written in sophisticated rewriting-based programming languages such as CafeOBJ, Haskell, Maude, OBJ*, etc. Also, a number of extensions (e.g., to conditional rewriting or constrained equational systems) and generalizations (e.g., controlled rewriting or forbidden patterns) of context-sensitive rewriting have been proposed. In this paper, we provide an overview of these applications and related issues.