When are Two Rewrite Systems More than None?

نویسنده

  • Nachum Dershowitz
چکیده

It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems (which compute normal forms of input terms) and consider the case where individual systems share constructors, but not de ned symbols. We present some old and new su cient conditions under which termination (existence of normal forms, regardless of computation strategy) and con uence (uniqueness) are preserved by such combinations.

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

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

منابع مشابه

On Termination of One Rule Rewrite Systems

The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...

متن کامل

Transforming Context - Sensitive RewriteSystemsJ

We present two new transformation techniques for proving termination of context-sensitive rewriting. Our rst method is simple, sound, and more powerful than previously suggested transformations. However, it is not complete, i.e., there are terminating context-sensitive rewrite systems that are transformed into non-terminating term rewrite systems. The second method that we present in this paper...

متن کامل

Transforming Context-Sensitive Rewrite Systems

We present two new transformation techniques for proving termination of context-sensitive rewriting. Our rst method is simple, sound, and more powerful than previously suggested transformations. However, it is not complete, i.e., there are terminating context-sensitive rewrite systems that are transformed into non-terminating term rewrite systems. The second method that we present in this paper...

متن کامل

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...

متن کامل

Hierachical Termination

From a practical perspective, it is important for programs to have modular correctness properties. Some (largely syntactic) sufficient conditions are given here for the union of terminating rewrite systems to be terminating, particularly in the hierarchical case, when one of the systems makes no reference to functions defined by the other. 1 I n t r o d u c t i o n A rewrite rule is an equation...

متن کامل

افزودن به منابع من


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

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1997