Skip to main content
SpringerLink
Log in
Book cover

Rewriting Techniques and Applications

6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Jieh Hsiang
    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 914)

Included in the following conference series:

Conference proceedings info: RTA 1995.

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

  1. Front Matter

    Download chapter PDF

  2. On some mathematical logic contributions to rewriting techniques: Lost heritage

    • Yuri Matiyasevich
    Pages 1-1

  3. Modularity of completeness revisited

    • Massimo Marchiori
    Pages 2-10

  4. Automatic termination proofs with transformation orderings

    • Joachim Steinbach
    Pages 11-25

  5. A termination ordering for higher order rewrite systems

    • Olav Lysne, Javier Piris
    Pages 26-40

  6. A complete characterization of termination of 0p 1q→1r 0s

    • Hans Zantema, Alfons Geser
    Pages 41-55

  7. On narrowing, refutation proofs and constraints

    • Robert Nieuwenhuis
    Pages 56-70

  8. Completion for multiple reduction orderings

    • Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
    Pages 71-85

  9. Towards an efficient construction of test sets for deciding ground reducibility

    • Klaus Schmid, Roland Fettig
    Pages 86-100

  10. Term rewriting in contemporary resolution theorem proving

    • Mark E. Stickel
    Pages 101-101

  11. δο!∈=1 Optimizing optimal λ-calculus implementations

    • Andrea Asperti
    Pages 102-116

  12. Substitution tree indexing

    • Peter Graf
    Pages 117-131

  13. Concurrent garbage collection for concurrent rewriting

    • Ilies Alouini
    Pages 132-146

  14. Lazy rewriting and eager machinery

    • J. F. Th. Kamperman, H. R. Walters
    Pages 147-162

  15. A rewrite mechanism for logic programs with negation

    • Siva Anantharaman, Gilles Richard
    Pages 163-178

  16. Level-confluence of conditional rewrite systems with extra variables in right-hand sides

    • Taro Suzuki, Aart Middeldorp, Tetsuo Ida
    Pages 179-193

  17. A polynomial algorithm testing partial confluence of basic semi-Thue systems

    • Géraud Sénizergues
    Pages 194-209

  18. Problems in rewriting applied to categorical concepts by the example of a computational comonad

    • Wolfgang Gehrke
    Pages 210-224

  19. Relating two categorical models of term rewriting

    • A. Corradini, F. Gadducci, U. Montanari
    Pages 225-240

  20. Towards a domain theory for termination proofs

    • Stefan Kahrs
    Pages 241-255
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

About this book

This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995.
The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop.
The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation