Del 256 - Lecture Notes in Computer Science

Rewriting Techniques and Applications

Bordeaux, France, May 25-27, 1987. Proceedings

Häftad, Engelska, 1987

Av Pierre Lescanne

499 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

Produktinformation

Utgivningsdatum1987-05-14
Mått155 x 235 x 17 mm
Vikt452 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor288
Upplaga1987
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540172208

Tillhör följande kategorier

Operativsystem inom Data och it
Systemvetenskap och AI inom Data och it
Matematikens grunder inom Naturvetenskap och teknik

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.