Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Vincent Oostrom

    1. Department of Philosophy, Utrecht University, Utrecht, The Netherlands

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

Included in the following conference series:

Conference proceedings info: RTA 2004.

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

  1. Front Matter

    Download chapter PDF

  2. Termination Analysis of the Untyped λ-Calculus

    • Neil D. Jones, Nina Bohr
    Pages 1-23

  3. A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems

    • Frédéric Blanqui
    Pages 24-39

  4. Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms

    • Yoshihito Toyama
    Pages 40-54

  5. Monadic Second-Order Unification Is NP-Complete

    • Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
    Pages 55-69

  6. A Certified AC Matching Algorithm

    • Evelyne Contejean
    Pages 70-84

  7. Matchbox : A Tool for Match-Bounded String Rewriting

    • Johannes Waldmann
    Pages 85-94

  8. TORPA: Termination of Rewriting Proved Automatically

    • Hans Zantema
    Pages 95-104

  9. Querying Unranked Trees with Stepwise Tree Automata

    • Julien Carme, Joachim Niehren, Marc Tommasi
    Pages 105-118

  10. A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

    • Toshinori Takai
    Pages 119-133

  11. Rewriting for Fitch Style Natural Deductions

    • Herman Geuvers, Rob Nederpelt
    Pages 134-154

  12. Efficient λ-Evaluation with Interaction Nets

    • Ian Mackie
    Pages 155-169

  13. Proving Properties of Term Rewrite Systems via Logic Programs

    • Sébastien Limet, Gernot Salzer
    Pages 170-184

  14. On the Modularity of Confluence in Infinitary Term Rewriting

    • Jakob Grue Simonsen
    Pages 185-199

  15. mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting

    • Salvador Lucas
    Pages 200-209

  16. Automated Termination Proofs with AProVE

    • Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
    Pages 210-220

  17. An Approximation Based Approach to Infinitary Lambda Calculi

    • Stefan Blom
    Pages 221-232

  18. Böhm-Like Trees for Term Rewriting Systems

    • Jeroen Ketema
    Pages 233-248

  19. Dependency Pairs Revisited

    • Nao Hirokawa, Aart Middeldorp
    Pages 249-268

  20. Inductive Theorems for Higher-Order Rewriting

    • Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama
    Pages 269-284
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

Editors and Affiliations

  • Department of Philosophy, Utrecht University, Utrecht, The Netherlands

    Vincent Oostrom

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation