Verkauf durch Sack Fachmedien

Lescanne

Rewriting Techniques and Applications

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

Medium: Buch
ISBN: 978-3-540-17220-8
Verlag: Springer
Erscheinungstermin: 14.05.1987
Lieferfrist: bis zu 10 Tage

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


Produkteigenschaften


  • Artikelnummer: 9783540172208
  • Medium: Buch
  • ISBN: 978-3-540-17220-8
  • Verlag: Springer
  • Erscheinungstermin: 14.05.1987
  • Sprache(n): Englisch
  • Auflage: 1. Auflage 1987
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 452 g
  • Seiten: 288
  • Format (B x H x T): 155 x 235 x 17 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

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.