Rewriting Techniques and Applications

Description:

Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000. Proceedings<br />Author: Leo Bachmair<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67778-9<br /> DOI: 10.1007/10721975<br /><br />Table of Contents:<p></p><ul><li>Rewriting Logic and Maude: Concepts and Applications </li><li>Tree Automata and Term Rewrite Systems </li><li>Absolute Explicit Unification </li><li>Termination and Confluence of Higher-Order Rewrite Systems </li><li>A de Bruijn Notation for Higher-Order Rewriting </li><li>Rewriting Techniques in Theoretical Physics </li><li>Normal Forms and Reduction for Theories of Binary Relations </li><li>Parallelism Constraints </li><li>Linear Higher-Order Matching Is NP-Complete </li><li>Standardization and Confluence for a Lambda Calculus with Generalized Applications </li><li>Linear Second-Order Unification and Context Unification with Tree-Regular Constraints </li><li>Word Problems and Confluence Problems for Restricted Semi-Thue Systems </li><li>The Explicit Representability of Implicit Generalizations </li><li>On the Word Problem for Combinators </li><li>An Algebra of Resolution </li><li>Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems </li><li>Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability </li><li>System Description: The Dependency Pair Method </li><li>REM (Reduce Elan Machine): Core of the New ELAN Compiler </li><li>TALP: A Tool for the Termination Analysis of Logic Programs</li></ul>

subjects: Computer programming,  Rewriting systems (Computer science),  Algorithms,  Congresses,  Computer science