Research Catalog

Rewriting techniques and applications : Bordeaux, France, May 25-27, 1987, proceedings

Title
Rewriting techniques and applications : Bordeaux, France, May 25-27, 1987, proceedings / edited by Pierre Lescanne.
Publication
Berlin ; New York : Springer-Verlag, ©1987.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Book/TextUse in library QA267 .R48 1987Off-site

Details

Additional Authors
  • Lescanne, Pierre.
  • International Conference on Rewriting Techniques and Applications (2nd : 1987 : Bordeaux, France)
Description
vi, 285 pages : illustrations; 25 cm.
Summary
This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.
Series Statement
Lecture notes in computer science ; 256
Uniform Title
Lecture notes in computer science ; 256.
Subject
  • Rewriting systems (Computer science) > Congresses
  • Computer programming > Congresses
  • Computer algorithms > Congresses
  • Computer algorithms
  • Computer programming
  • Rewriting systems (Computer science)
  • Datenverarbeitung
  • Produktion Informatik
  • Reduktionssystem
  • Termersetzungssystem
  • Kongress
  • Algebraïsche logica
  • Bewijstheorie
  • Specificatie
  • Computermethoden
  • Réécriture, Systèmes de (informatique) > Congrès
  • Algorithmes > Informatique > Congrès
  • Produktion (Informatik)
Genre/Form
Conference papers and proceedings
Note
  • Proceedings of the Second International Conference on Rewriting Techniques and Applications.
Bibliography (note)
  • Includes bibliographical references.
System Details (note)
  • Mode of access: World Wide Web.
Contents
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.
ISBN
  • 0387172203
  • 9780387172200
  • 3540172203
  • 9783540172208
LCCN
87012934
OCLC
  • ocm15792784
  • 15792784
  • SCSB-9194805
Owning Institutions
Princeton University Library