Titlebook: Rewriting Techniques and Applications; 4th International Co Ronald V. Book Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 19

Dendritic-Cells

Flagging

多山

流動(dòng)才波動(dòng)

Pedagogy

Visual-Field

Redex capturing in term graph rewriting (concise version),e-efficient method for implementing term rewrite systems. Certain structure sharing schemes can lead to a situation in which a term graph component is rewritten to another component that contains the original. This phenomenon, called . introduces cycles into the term graph which is being rewritten—e

耕種

Rewriting, and equational unification: the higher-order cases, and equational unification and their properties. This provides a basis for generalizing the first- and restricted higher-order results for these concepts. As examples, we generalize Plotkin‘s criteria for building-in equational theories, and show that pure third-order equational matching is undecid

Alveolar-Bone

Adding algebraic rewriting to the untyped lambda calculus (extended abstract),“stable”, we prove that the resulting calculus is confluent if . is confluent, and terminating if . is terminating. The termination result has the corresponding theorems for several typed calculi as corollaries. The proof of the confluence result yields a general method for proving confluence of typ

無(wú)動(dòng)于衷

Incremental termination proofs and the length of derivations,incremental termination proof for a term rewriting system . can be used to derive upper bounds on the length of derivations in .. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.

PANEL