Inequational Deduction as Term Graph Rewriting
نویسندگان
چکیده
منابع مشابه
Term Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملTransitive Term Graph Rewriting
A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are larg...
متن کاملTerm Graph Rewriting
O. Introduction. In this paper we will discuss in an informM way some aspects of t@rm graph rewriting. We will indicate why this subject falls in the scope of higher-order rewriting, and thus in the scope of the present workshop. Our discussion will be loosely structured by a numbered sequence of keywords and phrases, thereby following a talk given at the workshop. In the theory of rewriting, t...
متن کاملTerm Graph Rewriting
ion operator, 38 acyclic, 48 algebraic specification, 3 alpha conversion of cyclic terms, 44 annotated path, 47 ARS with finite information content, 105 with information content, 105 ARSI, 105 bisimilarity of terms, 92 context, 43 context restricted rewrite system, 39 continuity substitutive -, 134 syntactic -, 134 CRS rewrite rule, 38 cyclic term, 43 dag, 6 directed acyclic graph, 6 directed s...
متن کاملConditional Term Graph Rewriting
For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2002.09.004