Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Claude Kirchner

    1. INRIA Lorraine and CRIN, Villers les Nancy Cedex, France

    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 690)

Included in the following conference series:

Conference proceedings info: RTA 1993.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (39 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Rewrite techniques in theorem proving

    • Leo Bachmair
    Pages 1-1

  3. Redundancy criteria for constrained completion

    • Christopher Lynch, Wayne Snyder
    Pages 2-16

  4. Bi-rewriting, a term rewriting technique for monotonic order relations

    • Jordi Levy, Jaume Agustí
    Pages 17-31

  5. A case study of completion modulo distributivity and Abelian groups

    • Hantao Zhang
    Pages 32-46

  6. A semantic approach to order-sorted rewriting

    • Andreas Werner
    Pages 47-61

  7. Distributing equational theorem proving

    • J. Avenhaus, J. Denzinger
    Pages 62-76

  8. On the correctness of a distributed memory Gröbner basis algorithm

    • Soumen Chakrabarti, Katherine Yelick
    Pages 77-91

  9. Improving transformation systems for general E-unification

    • Max Moser
    Pages 92-105

  10. Equational and membership constraints for infinite trees

    • Joachim Niehren, Andreas Podelski, Ralf Treinen
    Pages 106-120

  11. Regular path expressions in feature logic

    • Rolf Backofen
    Pages 121-135

  12. Proving properties of typed lambda terms: Realizability, covers, and sheaves

    • Jean Gallier
    Pages 136-136

  13. Some lambda calculi with categorical sums and products

    • Daniel J. Dougherty
    Pages 137-151

  14. Paths, computations and labels in the λ-calculus

    • Andrea Asperti, Cosimo Laneve
    Pages 152-167

  15. Confluence and superdevelopments

    • Femke van Raamsdonk
    Pages 168-182

  16. Relating graph and term rewriting via Böhm models

    • Zena M. Ariola
    Pages 183-197

  17. Topics in termination

    • Nachum Dershowitz, Charles Hoot
    Pages 198-212

  18. Total termination of term rewriting

    • M. C. F. Ferreira, H. Zantema
    Pages 213-227

  19. Simple termination is difficult

    • Aarl Middeldorp, Bernhard Gramlich
    Pages 228-242

  20. Optimal normalization in orthogonal term rewriting systems

    • Zurab Khasidashvili
    Pages 243-258
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

About this book

This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.

Editors and Affiliations

  • INRIA Lorraine and CRIN, Villers les Nancy Cedex, France

    Claude Kirchner

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation