Contents of the Proceedings of the
11th International Conference on Rewriting Techniques and Applications.
Norwich, U.K., July 10-12, 2000.
Lecture Notes in Computer Science, Vol. 1833, Springer Verlag.
Editor: Leo Bachmair.
Invited Talks
- J. Meseguer,
Rewriting Logic and Maude: Concepts and Applications
(pages 1-26).
- A. Voronkov,
Formulae over Reduction Orderings: Some Solved and yet Unsolved
Problems.
- D. Miller,
Abstract Syntax for Variable Binders.
Invited Tutorial
- S. Tison,
Tree Automata and Term Rewrite Systems
(pages 27-30).
Regular Papers
- N. Bjorner and C. Munoz,
Absolute Explicit Unification
(pages 31-46).
- F. Blanqui,
Termination and Confluence of Higher-Order Rewrite Systems
(pages 47-61).
- E. Bonelli, D. Kesner, and A. Ríos,
A de Bruijn Notation for Higher-Order Rewriting
(pages 62-79).
- E. Contejean, A. Coste, and B. Monate,
Rewriting Techniques Applied to Theoretical Physics
(pages 80-94).
- D. Dougherty and C. Gutierrez,
Normal Forms and Reduction for Theories of Binary Relations
(pages 95-109).
- K. Erk and J. Niehren,
Parallelism Constraints
(pages 110-126).
- P. de Groote,
Higher-Order Linear Matching is NP-Complete
(pages 127-140).
- F. Joachimski and R. Matthes,
Standardization and Confluence for a Lambda Calculus with
Generalized Applications
(pages 141-155).
- J. Levy and M. Villaret,
Linear Second-Order Unification and Context Unification with
Tree-Regular Constraints
(pages 156-171).
- M. Lohrey,
Word Problems and Confluence Problems for Restricted Semi-Thue
Systems
(pages 172-186).
- R. Pichler,
The Explicit Representability of Implicit Generalizations
(pages 187-202).
- R. Statman,
On the Word Problem for Combinators
(pages 203-213).
- G. Struth,
An Algebra of Resolution
(pages 214-228).
- J. Stuber,
Deriving Theory Superposition Calculi from Convergent Term Rewriting
Systems
(pages 229-245).
- T. Takai, Y. Kaji, and H. Seki,
Right-Linear Finite Overlapping Term Rewriting Systems Effectively
Preserve Recognizability
(pages 246-260).
System Descriptions
- T. Arts,
The Dependency Pair Method
(pages 261-264).
- P.-E. Moreau,
REM (Reduce Elan Machine): Core of the New ELAN Compiler
(pages 265-269).
- E. Ohlebusch, C. Claves, and C. Marché,
TALP: A Tool for the Termination Analysis of Logic Programs
(pages 270-273).