Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. A replacement map discriminates, for each symbol of the signature, the argument positions on which replacements are allowed. If the replacement restrictions are less restrictive than those expressed by the so-called canonical replacement map, then CSR can be used for computing (infinite) normal forms of terms. Termination of such canonical CSR is desirable when using CSR for these purposes. Existing transformations for proving termination of CSR fulfill a number of new properties when used for proving termination of canonical CSR
Abstract. Termination of context-sensitive rewriting (CSR) is an inter-esting problem with several a...
Termination is one of the most interesting problems when dealing with context-sensitive rewrite syst...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
AbstractContext-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on ...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for m...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
Abstract. Termination is one of the most interesting problems when dealing with context-sensitive re...
Context-sensitive rewriting (CSR) is a variant of rewriting where only selected arguments of functio...
Abstract. Termination is one of the most interesting problems when dealing with context-sensitive re...
Abstract. Termination of context-sensitive rewriting (CSR) is an inter-esting problem with several a...
Termination is one of the most interesting problems when dealing with context-sensitive rewrite syst...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
AbstractContext-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on ...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for m...
Restrictions of rewriting may turn normal forms of some terms unreachable, leading to incomplete co...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
Abstract. Termination is one of the most interesting problems when dealing with context-sensitive re...
Context-sensitive rewriting (CSR) is a variant of rewriting where only selected arguments of functio...
Abstract. Termination is one of the most interesting problems when dealing with context-sensitive re...
Abstract. Termination of context-sensitive rewriting (CSR) is an inter-esting problem with several a...
Termination is one of the most interesting problems when dealing with context-sensitive rewrite syst...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...