Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

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

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Nachum Dershowitz
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 355)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (47 papers)

  1. Front Matter

    Download chapter PDF

  2. Term rewriting and universal algebra in historical perspective

    • Garrett Birkhoff
    Pages 1-1

  3. Characterizations of unification type zero

    • Franz Baader
    Pages 2-14

  4. Proof normalization for resolution and paramodulation

    • Leo Bachmair
    Pages 15-28

  5. Complete sets of reductions modulo associativity, commutativity and identity

    • Timothy B. Baird, Gerald E Peterson, Ralph W. Wilkerson
    Pages 29-44

  6. Completion-time optimization of rewrite-time goal solving

    • Hubert Bertling, Harald Ganzinger
    Pages 45-58

  7. Computing ground reducibility and inductively complete positions

    • Reinhard Bündgen, Wolfgang Küchlin
    Pages 59-75

  8. Inductive proofs by specification transformations

    • Hubert Comon
    Pages 76-91

  9. Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction

    • John Darlington, Yi-ke Guo
    Pages 92-108

  10. Simulation of Turing machines by a left-linear rewrite rule

    • Max Dauchet
    Pages 109-120

  11. Higher-order unification with dependent function types

    • Conal M. Elliott
    Pages 121-136

  12. An overview of LP, the Larch Prover

    • Stephen J. Garland, John V. Guttag
    Pages 137-151

  13. Graph grammars, a new paradigm for implementing visual languages

    • Herbert Göttler
    Pages 152-166

  14. Termination proofs and the length of derivations

    • Dieter Hofbauer, Clemens Lautemann
    Pages 167-177

  15. Abstract rewriting with concrete operators

    • Stéphane Kaplan, Christine Choppy
    Pages 178-186

  16. On how to move mountains ‘associatively and commutatively’

    • Mike Lai
    Pages 187-202

  17. Generalized Gröbner bases: Theory and applications. A condensation

    • Dallas Lankford
    Pages 203-221

  18. A local termination property for term rewriting systems

    • Dana May Latch, Ron Sigal
    Pages 222-233

  19. An equational logic sampler

    • George F. McNulty
    Pages 234-262

  20. Modular aspects of properties of term rewriting systems related to normal forms

    • Aart Middeldorp
    Pages 263-277
Back to top

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation