Rewriting techniques and applications. 11th international conference, RTA 2000, Norwich, GB, July 10--12, 2000. Proceedings (Q1572699)

The articles of mathematical interest will be reviewed individually. The preceding conference (10th, 1999) has been indicated (see Zbl 0916.00018). Indexed articles: \textit{Meseguer, José}, Rewriting logic and Maude: Concepts and applications, 1-26 [Zbl 0964.68069] \textit{Tison, Sophie}, Tree automata and term rewrite systems, 27-30 [Zbl 0964.68522] \textit{Bjørner, Nikolaj; Muñoz, César}, Absolute explicit unification, 31-46 [Zbl 0964.03009] \textit{Blanqui, Frédéric}, Termination and confluence of higher-order rewrite systems, 47-61 [Zbl 0964.68070] \textit{Bonelli, Eduardo; Kesner, Delia; Ríos, Alejandro}, A de Bruijn notation for higher-order rewriting. (Extended abstract), 62-79 [Zbl 0964.68520] \textit{Contejean, Evelyne; Coste, Antoine; Monate, Benjamin}, Rewriting techniques in theoretical physics, 80-94 [Zbl 0964.68149] \textit{Dougherty, Dan; Gutiérrez, Claudio}, Normal forms and reduction for theories of binary relations, 95-109 [Zbl 0964.03069] \textit{Erk, Katrin; Niehren, Joachim}, Parallelism constraints, 110-126 [Zbl 0964.68068] \textit{de Groote, Philippe}, Linear higher-order matching is NP-complete, 127-140 [Zbl 0964.68067] \textit{Joachimski, Felix; Matthes, Ralph}, Standardization and confluence for a lambda calculus with generalized applications, 141-155 [Zbl 0964.03014] \textit{Levy, Jordi; Villaret, Mateu}, Linear second-order unification and context unification with tree-regular constraints, 156-171 [Zbl 0964.68074] \textit{Lohrey, Markus}, Word problems and confluence problems for restricted semi-Thue systems, 172-186 [Zbl 0964.68072] \textit{Pichler, Reinhard}, The explicit representability of implicit generalizations, 187-202 [Zbl 0964.68071] \textit{Statman, Rick}, On the word problem for combinators, 203-213 [Zbl 0964.03013] \textit{Struth, Georg}, An algebra of resolution, 214-228 [Zbl 0964.03010] \textit{Stuber, Jürgen}, Deriving theory superposition calculi from convergent term rewriting systems, 229-245 [Zbl 0964.68521] \textit{Takai, Toshinori; Kaji, Yuichi; Seki, Hiroyuki}, Right-linear finite path overlapping term rewriting systems effectively preserve recognizability, 246-260 [Zbl 0964.68073] \textit{Arts, Thomas}, System description: The dependency pair method, 261-264 [Zbl 0964.68562] \textit{Moreau, Pierre-Etienne}, REM (Reduce Elan Machine): Core of the new ELAN compiler, 265-269 [Zbl 0964.68560] \textit{Ohlebusch, Enno; Claves, Claus; Marché, Claude}, TALP: A tool for the termination analysis of logic programs, 270-273 [Zbl 0964.68563]