Umfang:
Online-Ressource (VI, 285 S.)
Ausgabe:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540474210
Serie:
Lecture notes in computer science 256
Inhalt:
Term-rewriting implementation of equational logic programming -- Optimizing equational programs -- A compiler for conditional term rewriting systems -- How to choose the weights in the Knuth Bendix ordering -- Detecting looping simplifications -- Combinatorial hypermap rewriting -- The word problem for finitely presented monoids and finite canonical rewriting systems -- Term rewriting systems with priorities -- A gap between linear and non linear term-rewriting systems -- Code generator generation based on template-driven target term rewriting -- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction -- Groups presented by certain classes of finite length-reducing string-rewriting systems -- Some results about confluence on a given congruence class -- Ground confluence -- Structured contextual rewriting -- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes -- Completion for rewriting modulo a congruence -- On equational theories, unification and decidability -- A general complete E-unification procedure -- Improving basic narrowing techniques -- Strategy-controlled reduction and narrowing -- Algorithmic complexity of term rewriting systems -- Optimal speedups for parallel pattern matching in trees.
Inhalt:
This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540172203
Weitere Ausg.:
ISBN 0387172203
Weitere Ausg.:
ISBN 9783540172208
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Rewriting techniques and applications Berlin [u.a.] : Springer, 1987 ISBN 3540172203
Weitere Ausg.:
ISBN 0387172203
Sprache:
Englisch
Schlagwort(e):
Reduktionssystem
;
Konferenzschrift
DOI:
10.1007/3-540-17220-3
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
