Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Harald Ganzinger
    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 1103)

Included in the following conference series:

Conference proceedings info: RTA 1996.

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 (37 papers)

  1. Front Matter

    Download chapter PDF

  2. Rewrite-based automated reasoning: Challenges ahead

    • Deepak Kapur
    Pages 1-2

  3. Fine-grained concurrent completion

    • Claude Kirchner, Christopher Lynch, Christelle Scharff
    Pages 3-17

  4. AC-complete unification and its application to theorem proving

    • Alexandre Boudet, Evelyne Contejean, Claude Marché
    Pages 18-32

  5. Superposition theorem proving for abelian groups represented as integer modules

    • Jürgen Stuber
    Pages 33-47

  6. Symideal Gröbner bases

    • Manfred Göbel
    Pages 48-62

  7. Termination of constructor systems

    • Thomas Arts, Jürgen Giesl
    Pages 63-77

  8. Dummy elimination in equational rewriting

    • M. C. F. Ferreira
    Pages 78-92

  9. On proving termination by innermost termination

    • Bernhard Gramlich
    Pages 93-107

  10. A recursive path ordering for higher-order terms in η-long β-normal form

    • Jean-Pierre Jouannaud, Albert Rubio
    Pages 108-122

  11. Higher-order superposition for dependent types

    • Roberto Virga
    Pages 123-137

  12. Higher-order narrowing with definitional trees

    • Michael Hanus, Christian Prehofer
    Pages 138-152

  13. Design of a proof assistant

    • Gérard Huet
    Pages 153-153

  14. A compiler for nondeterministic term rewriting systems

    • Marian Vittek
    Pages 154-168

  15. Combinatory reduction systems with explicit substitution that preserve strong normalisation

    • Roel Bloo, Kristoffer H. Rose
    Pages 169-183

  16. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)

    • Delia Kesner
    Pages 184-199

  17. On the power of simple diagrams

    • Roberto Di Cosmo
    Pages 200-214

  18. Coherence for sharing proof nets

    • S. Guerrini, S. Martini, A. Masini
    Pages 215-229

  19. Modularity of termination in term graph rewriting

    • M. R. K. Krishna Rao
    Pages 230-244

  20. Confluence of terminating conditional rewrite systems revisited

    • Bernhard Gramlich, Claus-Peter Wirth
    Pages 245-259
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996.
The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation