Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Rewriting Techniques and Applications

Bordeaux, France, May 25-27, 1987. Proceedings

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Pierre Lescanne
    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 256)

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 49.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 (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Term-rewriting implementation of equational logic programming

    • Michael J. O'Donnell
    Pages 1-12

  3. Optimizing equational programs

    • Robert Strandh
    Pages 13-24

  4. A compiler for conditional term rewriting systems

    • Stéphane Kaplan
    Pages 25-41

  5. How to choose the weights in the Knuth Bendix ordering

    • Ursula Martin
    Pages 42-53

  6. Detecting looping simplifications

    • Paul Walton Purdom Jr.
    Pages 54-61

  7. Combinatorial hypermap rewriting

    • Eric Sopena
    Pages 62-73

  8. The word problem for finitely presented monoids and finite canonical rewriting systems

    • Craig Squier, Friedrich Otto
    Pages 74-82

  9. Term rewriting systems with priorities

    • J. C. M. Baeten, J. A. Bergstra, J. W. Klop
    Pages 83-94

  10. A gap between linear and non linear term-rewriting systems

    • M. Dauchet, DE Comite
    Pages 95-104

  11. Code generator generation based on template-driven target term rewriting

    • Annie Despland, Monique Mazaud, Raymond Rakotozafy
    Pages 105-120

  12. Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction

    • M. Benois
    Pages 121-132

  13. Groups presented by certain classes of finite length-reducing string-rewriting systems

    • Klaus Madlener, Friedrich Otto
    Pages 133-144

  14. Some results about confluence on a given congruence class

    • Friedrich Otto
    Pages 145-155

  15. Ground confluence

    • Richard Göbel
    Pages 156-167

  16. Structured contextual rewriting

    • Qian Zhenyu
    Pages 168-179

  17. Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes

    • Hélène Kirchner
    Pages 180-191

  18. Completion for rewriting modulo a congruence

    • Leo Bachmair, Nachum Dershowitz
    Pages 192-203

  19. On equational theories, unification and decidability

    • Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
    Pages 204-215

  20. A general complete E-unification procedure

    • Jean H. Gallier, Wayne Snyder
    Pages 216-227
Back to top

Keywords

About this book

This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation