Titlebook: Rewriting Techniques and Applications; Bordeaux, France, Ma Pierre Lescanne Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1

使人煩燥

Optimizing equational programs,e reduction process. We show that our transformations indeed give . and . the mutual confluence property, thus preserving the output behavior of . when transformed to ...Preserving the output behavior is more general than preserving just normal forms, in that we allow for infinite computations where

gratify

Detecting looping simplifications,the interaction of several rules, but it is limited to those cases where each application of a rule occurs inside of the previous rule application. Experiments suggest that the simplest form of the algorithm is about 80 percent effective in eliminating bad orientations of rules. The algorithm never

武器

Code generator generation based on template-driven target term rewriting,struction pattern..The local and global optimizations phases as well as the storage management phase may be realized by multipass rewritings and attribute evaluations of the canonical form..In the last phase of code production, each pattern instruction instance of the updated intermediate form is re

抗體

Optimizing equational programs,ubterm that matches the left hand side of the equation is replaced by the corresponding right hand side. In that process several . of the term tree are created. Some of these nodes may later turn out to be useless, and will be reclaimed..This paper discusses important relationships between two equat

合適

How to choose the weights in the Knuth Bendix ordering,weights of the operators they contain. Our purpose in this paper is twofold. First we give some examples to indicate the flexibility of the method. Then we give a simple and practical algorithm, based on the simplex algorithm, for determining whether or not a set of rules can be ordered by a Knuth B

Moderate

Detecting looping simplifications, rewrite rule .→. leads to an infinite sequence of “simplifications”. The rule .→. can be tested in the same way. Rules leading to infinite simplifications should not be included in a rewrite system. In general, the problem of deciding whether a set of rewrite rules leads to infinite simplifications

影響帶來

Combinatorial hypermap rewriting,a purely combinatorial formulation of the rewriting mechanism. We illustrate this definition by providing a hypermap grammar which generates the set of all connected planar maps. We also investigate a special kind of hypermap grammars, the H-grammars, for which we give a Pumping Theorem enlightening

isotope

撤退

Hemiplegia

Some results about confluence on a given congruence class,he term-rewriting systems under consideration contain unary function symbols only, and all their rules are length-reducing. On the other hand, for certain subclasses of these systems confluence on a given congruence class is decidable.