Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

Dijon, France, May 20-22, 1985

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Jean-Pierre Jouannaud
    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 202)

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 59.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 (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Basic features and development of the critical-pair/completion procedure

    • Bruno Buchberger
    Pages 1-45

  3. Contextual rewriting

    • Hantao Zhang, Jean-Luc Remy
    Pages 46-62

  4. Thue systems as rewriting systems

    • Ronald V. Book
    Pages 63-94

  5. Deciding algebraic properties of monoids presented by finite church-rosser Thue systems

    • Friedrich Otto
    Pages 95-106

  6. Two applications of equational theories to database theory

    • Stavros S. Cosmadakis, Paris C. Kanellakis
    Pages 107-123

  7. An experiment in partial evaluation: The generation of a compiler generator

    • Neil D. Jones, Peter Sestoft, Harald Søndergaard
    Pages 124-140

  8. NARROWER: a new algorithm for unification and its application to Logic Programming

    • Pierre Rety, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
    Pages 141-157

  9. Solving type equations by graph rewriting

    • Hassan Ait-Kaci
    Pages 158-179

  10. Termination

    • Nachum Dershowitz
    Pages 180-224

  11. Path of subterms ordering and recursive decomposition ordering revisited

    • Michael Rusinowitch
    Pages 225-240

  12. Associative path orderings

    • Leo Bachmair, David A. Plaisted
    Pages 241-254

  13. A procedure for automatically proving the termination of a set of rewrite rules

    • David Detlefs, Randy Forgaard
    Pages 255-270

  14. Petrireve: Proving Petri net properties with rewriting systems

    • C. Choppy, C. Johnen
    Pages 271-286

  15. Fairness in term rewriting systems

    • Sara Porat, Nissim Francez
    Pages 287-300

  16. Two results in term rewriting theorem proving

    • Jieh Hsiang
    Pages 301-324

  17. Handling function definitions through innermost superposition and rewriting

    • Laurent Fribourg
    Pages 325-344

  18. An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras

    • Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran
    Pages 345-364

  19. Combining unification algorithms for confined regular equational theories

    • Kathy Yelick
    Pages 365-380

  20. An algebraic approach to unification under associativity and commutativity

    • Albrecht Fortenbacher
    Pages 381-397
Back to top

Keywords

Bibliographic Information

  • Book Title: Rewriting Techniques and Applications

  • Book Subtitle: Dijon, France, May 20-22, 1985

  • Editors: Jean-Pierre Jouannaud

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-15976-2

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1985

  • Softcover ISBN: 978-3-540-15976-6Published: 01 October 1985

  • eBook ISBN: 978-3-540-39679-6Published: 30 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 444

  • Topics: Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation