Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

4th International Conference, RTA-91, Como, Italy, April 10-12, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Ronald V. Book
    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 488)

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

  1. Front Matter

    Download chapter PDF

  2. Transfinite reductions in orthogonal term rewriting systems

    • J. R. Kennaway, J. W. Klop, M. R. Sleep, F. J. de Vries
    Pages 1-12

  3. Redex capturing in term graph rewriting (concise version)

    • William M. Farmer, Ronald J. Watro
    Pages 13-24

  4. Rewriting, and equational unification: the higher-order cases

    • D. A. Wolfram
    Pages 25-36

  5. Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

    • Daniel J. Dougherty
    Pages 37-48

  6. Incremental termination proofs and the length of derivations

    • Frank Drewes, Clemens Lautemann
    Pages 49-61

  7. Time bounded rewrite systems and termination proofs by generalized embedding

    • Dieter Hofbauer
    Pages 62-73

  8. Detecting redundant narrowing derivations by the LSE-SL reducibility test

    • Stefan Krischer, Alexander Bockmayr
    Pages 74-85

  9. Unification, weak unification, upper bound, lower bound, and generalization problems

    • Franz Baader
    Pages 86-97

  10. AC unification through order-sorted AC1 unification

    • Eric Domenjoud
    Pages 98-111

  11. Narrowing directed by a graph of terms

    • Jacques Chabin, Pierre Réty
    Pages 112-123

  12. Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification

    • Franz Baader, Werner Nutt
    Pages 124-135

  13. Undecidable properties of syntactic theories

    • Francis Klay
    Pages 136-149

  14. Goal directed strategies for paramodulation

    • Wayne Snyder, Christopher Lynch
    Pages 150-161

  15. Minimal solutions of linear diophantine systems : bounds and algorithms

    • Loïc Pottier
    Pages 162-173

  16. Proofs in parameterized specifications

    • Hélène Kirchner
    Pages 174-187

  17. Completeness of combinations of constructor systems

    • Aart Middeldorp, Yoshihito Toyama
    Pages 188-199

  18. Modular higher-order E-unification

    • Tobias Nipkow, Zhenyu Qian
    Pages 200-214

  19. On confluence for weakly normalizing systems

    • Pierre-Louis Curien, Giorgio Ghelli
    Pages 215-225

  20. Program transformation and rewriting

    • Françoise Bellegarde
    Pages 226-239
Back to top

Keywords

About this book

This volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA-91), held in Como, Italy, April 10-12, 1991. The volume includes 40 papers on a wide variety of topics including: term rewriting systems, equational unification, algebraic rewriting, termination proofs, generalization problems, undecidable properties, parametrized specifications, normalizing systems, program transformation, query optimization, tree languages, graph languages, theorem proving systems, completion, graph rewriting systems, and open problems.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation