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

by Bachmair, Leo; International Conference on Rewriting Techniques and Applications (11th : 2000 : Norwich, England)

• ISBN13: 9783540677789
• ISBN10: 354067778X
• Format: Paperback
• Copyright: 2000-08-01
• Publisher: Springer Verlag

Summary

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.

Table of Contents

Invited Talk
Rewriting Logic and Maude: Concepts and Applications	1	(26)
Jose Meseguer
Invited Tutorial
Tree Automata and Term Rewrite Systems (Extended Abstract)	27	(4)
Sophie Tison
Regular Papers
Absolute Explicit Unification	31	(16)
Nikolaj Bjorner
Cesar Munoz
Termination and Confluence of Higher-Order Rewrite Systems	47	(15)
Frederic Blanqui
A de Bruijn Notation for Higher-Order Rewriting (Extended Abstract)	62	(18)
Eduardo Bonelli
Delia Kesner
Alejandro Rios
Rewriting Techniques in Theoretical Physics	80	(15)
Evelyne Contejean
Antoine Coste
Benjamin Monate
Normal Forms and Reduction for Theories of Binary Relations	95	(15)
Dan Dougherty
Claudio Gutierrez
Parallelism Constraints	110	(17)
Katrin Erk
Joachim Niehren
Linear Higher-Order Matching Is NP-Complete	127	(14)
Philippe de Groote
Standardization and Confluence for a Lambda Calculus with Generalized Applications	141	(15)
Felix Joachimski
Ralph Matthes
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints	156	(16)
Jordi Levy
Mateu Villaret
Word Problems and Confluence Problems for Restricted Semi-Thue Systems	172	(15)
Markus Lohrey
The Explicit Representability of Implicit Generalizations	187	(16)
Reinhard Pichler
On the Word Problem for Combinators	203	(11)
Rick Statman
An Algebra of Resolution	214	(15)
Georg Struth
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems	229	(17)
Jurgen Stuber
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability	246	(15)
Toshinori Takai
Yuichi Kaji
Hiroyuki Seki
System Descriptions
System Description: The Dependency Pair Method	261	(4)
Thomas Arts
REM (Reduce Elan Machine): Core of the New ELAN Compiler	265	(5)
Pierre-Etienne Moreau
TALP: A Tool for the Termination Analysis of Logic Programs	270	(5)
Enno Ohlebusch
Claus Claves
Claude Marche
Author Index	275