Rewriting techniques and applications: 3rd International Conference, RTA-89, Chapel Hill, North Carolina, April 3-5, 1989 : proceedings

Research output: Book/ReportBookpeer-review

Abstract

Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculus. Applications cover broad areas in automated reasoning, programming language design, semantics, and implementations, and symbolic and algebraic manipulation. The proceedings of the third International Conference on Rewriting Techniques and Applications contain 34 regular papers, covering many diverse aspects of rewriting (including equational logic, decidability questions, term rewriting, congruence-class rewriting, string rewriting, conditional rewriting, graph rewriting, functional and logic programming languages, lazy and parallel implementations, termination issues, compilation techniques, completion procedures, unification and matching algorithms, deductive and inductive theorem proving, Gröbner bases, and program synthesis). It also contains 12 descriptions of implemented equational reasoning systems. Anyone interested in the latest advances in this fast growing area should read this volume.
Original languageEnglish
Place of PublicationBerlin
PublisherSpringer-Verlag
Number of pages579
ISBN (Electronic)0387510818, 3540461493, 9780387510811
StatePublished - 1989

Publication series

NameLecture notes in computer science
PublisherSpringer-Verlag

ULI Keywords

  • uli
  • Algorithms -- Congresses
  • Rewriting systems (Computer science) -- Congresses

Fingerprint

Dive into the research topics of 'Rewriting techniques and applications: 3rd International Conference, RTA-89, Chapel Hill, North Carolina, April 3-5, 1989 : proceedings'. Together they form a unique fingerprint.

Cite this