Rewriting Techniques and Applications

Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000. Proceedings
Author: Leo Bachmair
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67778-9
DOI: 10.1007/10721975

Table of Contents:

• Rewriting Logic and Maude: Concepts and Applications
• Tree Automata and Term Rewrite Systems
• 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 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