Rewriting Techniques and Applications

1. Front Matter

   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

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.

• Automatisches Schließen
• Beweissysteme
• Programmiersprache
• Rechnergestützte Entscheidung
• Term rewriting systems
• Verifikation
• optimization
• proving
• reasoning
• term rewriting
• theorem proving
• theorem proving systems
• verification
• algorithm analysis and problem complexity

Policies and ethics