Rewriting Techniques and Applications - neues Buch

EAN (ISBN-13): 9783540474210
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Zurich)
Detailseite zuletzt geändert am 2020-01-21T17:10:03+01:00 (Zurich)
ISBN/EAN: 9783540474210

ISBN - alternative Schreibweisen:
978-3-540-47421-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: rewriting

---

Daten vom Verlag:

Autor/in: Pierre Lescanne
Titel: Lecture Notes in Computer Science; Rewriting Techniques and Applications - Bordeaux, France, May 25-27, 1987. Proceedings
Verlag: Springer; Springer Berlin
288 Seiten
Erscheinungsjahr: 2005-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
37,44 € (DE)
38,50 € (AT)
47,00 CHF (CH)
Available
VIII, 288 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Monoid; algorithms; automata; complexity; logic; programming; term rewriting; C; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Computer Science; Mathematik: Logik; Mathematische Grundlagen; BC

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.