On the Uniquely Converging Property of Nonlinear Term Rewriting Systems

نویسندگان

  • Mizuhito OGAWA
  • Satoshi ONO
چکیده

A uniquely converging (UC) property for a possibly nonlinear term rewriting system (TRS) is investigated. UC, which is an intermediate property between conventional Church-Rosser (CR) and uniquely normalizing (UN), is newly proposed in connection with the consistency of continuous semantics. Continuous semantics is de ned by constructing free-continuous algebra which is required in algebraic speci cation on a lazy space. In fact, freecontinuous algebra can specify a lazy space, whereas neither initial algebra nor nal algebra can. This paper also clari es a su cient condition for UC. The statement is, an !-nonoverlapping TRS is UC (irrespective of linearlity). This makes the contrast with the well-known facts that a nonoverlapping TRS is possibly non-UN when nonlinear, although CR when left linear. The di erence between !-nonoverlapping and usual nonoverlapping is that uni cation with in nite terms is applied instead of usual uni cation with occur-check.

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

ثبت نام

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

منابع مشابه

Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-

This paper gives a purely syntactical proof, based on proof normalization techniques, of an extension of Chew's theorem. The main theorem is that a weakly compatible TRS is uniquely normalizing. Roughly speaking, the weakly compatible condition allows possibly nonlinear TRSs to have nonroot overlapping rules that return the same results. This result implies the consistency of CL-pc which is an ...

متن کامل

Transfinite Reductions in Orthogonal Term Rewriting Systems

We establish some fundamental facts for infinitary orthogonal term rewriting systems (OTRSs): for strongly convergent reductions we prove the Transfinite Parallel Moves Lemma and the Compressing Lemma. Strongness is necessary as shown by counterexamples. Normal forms (which we allow to be infinite) are unique, in contrast to ω-normal forms. Fair reductions result in ω-normal forms if they are c...

متن کامل

Confluent Term Rewriting Systems with Membership Conditions

1. I n t r o d u c t i o n Many term rewriting systems and their modifications are considered in logic, automated theorem proving, and programming language [2,3,4,6,8,9]. A fundamental property of term rewriting systems is the confluence property. A few sufficient criteria for the confluence are well known [2,3,4,5,8,9]. However, if a term rewriting system is nonterminating and nonlinear, we kn...

متن کامل

Modular Aspects of Rewrite-based Speciications

We investigate modular properties of term rewriting systems, the basic operational formalism for equational speciications. First we study suucient conditions for the preservation of the termination property under disjoint (and more general) combinations of term rewriting systems. By means of a reened analysis of existing approaches we show how to prove several new asymmetric preservation result...

متن کامل

Infinite Normal Forms for Non-Linear Term Rewritting Systems

Nonterminating rewrite relations have recently been studied in order to set a framework within which infinite terms can be seen as limits of infinite converging derivations. Results about the existence of infinite normal forms have been given only for orthogonal term rewriting systems, namely left-linear and nonoverlapping systems. In this paper we show that some of those results can be extende...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1989