Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1993

Rewriting Techniques and Applications

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

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)

Conference series link(s): RTA: International Conference on Rewriting Techniques and Applications

Conference proceedings info: RTA 1993.

Sections

Buy it now

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

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

Table of contents (39 papers)

  1. Front Matter

    Pages I-XI
    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

  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

  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

  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

  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
Back to top

Other Volumes

  1. Rewriting Techniques and Applications

Back to top

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.
Back to top

Keywords

Back to top

Editors and Affiliations

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

    Claude Kirchner

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation