Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings (Lecture Notes in Computer Science, 1833)

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. Front Matter....Pages - Rewriting Logic and Maude: Concepts and Applications....Pages 1-26 Tree Automata and Term Rewrite Systems....Pages 27-30 Absolute Explicit Unification....Pages 31-46 Termination and Confluence of Higher-Order Rewrite Systems....Pages 47-61 A de Bruijn Notation for Higher-Order Rewriting....Pages 62-79 Rewriting Techniques in Theoretical Physics....Pages 80-94 Normal Forms and Reduction for Theories of Binary Relations....Pages 95-109 Parallelism Constraints....Pages 110-126 Linear Higher-Order Matching Is NP-Complete....Pages 127-140 Standardization and Confluence for a Lambda Calculus with Generalized Applications....Pages 141-155 Linear Second-Order Unification and Context Unification with Tree-Regular Constraints....Pages 156-171 Word Problems and Confluence Problems for Restricted Semi-Thue Systems....Pages 172-186 The Explicit Representability of Implicit Generalizations....Pages 187-202 On the Word Problem for Combinators....Pages 203-213 An Algebra of Resolution....Pages 214-228 Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems....Pages 229-245 Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability....Pages 246-260 System Description: The Dependency Pair Method....Pages 261-264 REM (Reduce Elan Machine): Core of the New ELAN Compiler....Pages 265-269 TALP: A Tool for the Termination Analysis of Logic Programs....Pages 270-273 Back Matter....Pages - 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

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.

This volume constitutes the refereed proceedings of the 11th International Conference on Rewriting Techniques and Applications, RTA 2000, held in Norwich, UK, in July 2000.