Rewriting Techniques and Applications: 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings / Edition 1

Rewriting Techniques and Applications: 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings / Edition 1

by Vincent van Oostrom
ISBN-10:
3540221530
ISBN-13:
9783540221531
Pub. Date:
08/05/2004
Publisher:
Springer Berlin Heidelberg

Paperback - Rent for

Select a Purchase Option (2004)
  • purchase options
    $99.00
  • purchase options

Overview

Rewriting Techniques and Applications: 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings / Edition 1

This book constitutes the refereed proceedings of the 15th International Conference on Rewriting Techniques and Applications, RTA 2004, held in Aachen, Germany in June 2004.

Product Details

ISBN-13: 9783540221531
Publisher: Springer Berlin Heidelberg
Publication date: 08/05/2004
Series: Lecture Notes in Computer Science Series , #3091
Edition description: 2004
Pages: 315
Product dimensions: 6.10(w) x 9.17(h) x 0.03(d)

Table of Contents

Termination Analysis of the Untyped—-Calculus.- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.- Monadic Second-Order Unification Is NP-Complete.- A Certified AC Matching Algorithm.- Matchbox: A Tool for Match-Bounded String Rewriting.- TORPA: Termination of Rewriting Proved Automatically.- Querying Unranked Trees with Stepwise Tree Automata.- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.- Rewriting for Fitch Style Natural Deductions.- Efficient—-Evaluation with Interaction Nets.- Proving Properties of Term Rewrite Systems via Logic Programs.- On the Modularity of Confluence in Infinitary Term Rewriting.- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.- Automated Termination Proofs with AProVE.- An Approximation Based Approach to Infinitary Lambda Calculi.- Böhm-Like Trees for Term Rewriting Systems.- Dependency Pairs Revisited.- Inductive Theorems for Higher-Order Rewriting.- The Joinability and Unification Problems for Confluent Semi-constructor TRSs.- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews