Termination of (Canonical) Context-Sensitive Rewriting

نویسنده

  • Salvador Lucas
چکیده

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 canon-ical replacement map, then CSR can be used for computing (innnite) normal forms of terms. Termination of such canonical CSR is desirable when using CSR for these purposes. Existing transformations for proving termination of CSR fullll a number of new properties when used for proving termination of canonical CSR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Termination of Context-Sensitive Rewriting

Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...

متن کامل

Termination of context-sensitive rewriting

Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...

متن کامل

Termination of canonical context-sensitive rewriting and productivity of rewrite systems

Termination of programs, i.e., the absence of infinite computations, ensures the existence of normal forms for all initial expressions, thus providing an essential ingredient for the definition of a normalization semantics for functional programs. In lazy functional languages, though, infinite data structures are often delivered as the outcome of computations. For instance, the list of all prim...

متن کامل

Transformation techniques for context-sensitive rewrite systems

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 development of techniques to analyze the termination behavior of context-sensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform contextsensitive rewrit...

متن کامل

Automatic Proofs of Termination of Context-Sensitive Rewriting

The idea of an incremental application of different termination techniques asprocessors for solving termination problems has shown to be a powerful andefficient way to prove termination of rewriting. Nowadays, the dependencypair framework (which develops this idea) is the most successful approach forproving termination of rewriting. The dependency pair framework relies onthe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002