Lecture Notes in Computer Science

Rewriting Techniques and Applications

3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings

Editors: Dershowitz, Nachum (Ed.)

Free Preview

Buy this book

eBook $109.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-46149-4
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA in USD
  • ISBN 978-3-540-51081-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (47 chapters)

Table of contents (47 chapters)
  • Term rewriting and universal algebra in historical perspective

    Birkhoff, Garrett

    Pages 1-1

  • Characterizations of unification type zero

    Baader, Franz

    Pages 2-14

  • Proof normalization for resolution and paramodulation

    Bachmair, Leo

    Pages 15-28

  • Complete sets of reductions modulo associativity, commutativity and identity

    Baird, Timothy B. (et al.)

    Pages 29-44

  • Completion-time optimization of rewrite-time goal solving

    Bertling, Hubert (et al.)

    Pages 45-58

Buy this book

eBook $109.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-46149-4
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA in USD
  • ISBN 978-3-540-51081-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Rewriting Techniques and Applications
Book Subtitle
3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings
Editors
  • Nachum Dershowitz
Series Title
Lecture Notes in Computer Science
Series Volume
355
Copyright
1989
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-46149-4
DOI
10.1007/3-540-51081-8
Softcover ISBN
978-3-540-51081-9
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VII, 589
Topics