Skip to main content
  • Conference proceedings
  • © 2001

Rewriting Techniques and Applications

12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings

Editors:

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2051)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

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

Table of contents (27 papers)

  1. Front Matter

    Pages I-XII
  2. Invited Talks

    1. Computing and Proving

      • Henk Barendregt
      Pages 1-1
    2. Rewriting for Deduction and Verification

      • Michael Rusinowitch
      Pages 2-2
  3. Regular Papers

    1. General Recursion on Second Order Term Algebras

      • Alessandro Berarducci, Corrado Böhm
      Pages 15-30
    2. Beta Reduction Constraints

      • Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
      Pages 31-46
    3. From Higher-Order to First-Order Rewriting

      • Eduardo Bonelli, Delia Kesner, Alejandro Ríos
      Pages 47-62
    4. Combining Pattern E-Unification Algorithms

      • Alexandre Boudet, Evelyne Contejean
      Pages 63-76
    5. Matching Power

      • Horatiu Cirstea, Claude Kirchner, Luigi Liquori
      Pages 77-92
    6. Dependency Pairs for Equational Rewriting

      • Jürgen Giesl, Deepak Kapur
      Pages 93-107
    7. Uniform Normalisation beyond Orthogonality

      • Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
      Pages 122-136
    8. Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order

      • Konstantin Korovin, Andrei Voronkov
      Pages 137-153
    9. Relating Accumulative and Non-accumulative Functional Programs

      • Armin Kühnemann, Robert Glück, Kazuhiko Kakehi
      Pages 154-168
    10. Context Unification and Traversal Equations

      • Jordi Levy, Mateu Villaret
      Pages 169-184
    11. Weakly Regular Relations and Applications

      • Sébastien Limet, Pierre Réty, Helmut Seidl
      Pages 185-200
    12. On the Parallel Complexity of Tree Automata

      • Markus Lohrey
      Pages 201-215
    13. Goal-Directed E-Unification

      • Christopher Lynch, Barbara Morawska
      Pages 231-245
    14. The Unification Problem for Confluent Right-Ground Term Rewriting Systems

      • Michio Oyamaguchi, Yoshikatsu Ohta
      Pages 246-260

About this book

This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001.
The 23 revised full papers presented together with two system descriptions were carefully reviewed and selected from 55 submissions. All current aspects of rewriting are addressed.

Editors and Affiliations

  • Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, Japan

    Aart Middeldorp

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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