Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / Edition 1

Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings / Edition 1

by Leo Bachmair
     
 

ISBN-10: 354067778X

ISBN-13: 9783540677789

Pub. Date: 07/31/2000

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the 11th International Conference on Rewriting Techniques and Applications, RTA 2000, held in Norwich, UK, in July 2000.
The 15 revised full papers and three system descriptions presented together with two invited contributions were carefully reviewed and selected from 44 submissions. All current aspects of

Overview

This book constitutes the refereed proceedings of the 11th International Conference on Rewriting Techniques and Applications, RTA 2000, held in Norwich, UK, in July 2000.
The 15 revised full papers and three system descriptions presented together with two invited contributions were carefully reviewed and selected from 44 submissions. All current aspects of rewriting are addressed.

Product Details

ISBN-13:
9783540677789
Publisher:
Springer Berlin Heidelberg
Publication date:
07/31/2000
Series:
Lecture Notes in Computer Science Series, #1833
Edition description:
2000
Pages:
282
Product dimensions:
6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Invited Talk.- Rewriting Logic and Maude: Concepts and Applications.- Invited Tutorial.- Tree Automata and Term Rewrite Systems.- Regular Papers.- Absolute Explicit Unification.- Termination and Confluence of Higher-Order Rewrite Systems.- A de Bruijn Notation for Higher-Order Rewriting.- Rewriting Techniques in Theoretical Physics.- Normal Forms and Reduction for Theories of Binary Relations.- Parallelism Constraints.- Linear Higher-Order Matching Is NP-Complete.- Standardization and Confluence for a Lambda Calculus with Generalized Applications.- Linear Second-Order Unification and Context Unification with Tree-Regular Constraints.- Word Problems and Confluence Problems for Restricted Semi-Thue Systems.- The Explicit Representability of Implicit Generalizations.- On the Word Problem for Combinators.- An Algebra of Resolution.- Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems.- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability.- System Descriptions.- System Description: The Dependency Pair Method.- REM (Reduce Elan Machine): Core of the New ELAN Compiler.- TALP: A Tool for the Termination Analysis of Logic Programs.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >