@InProceedings{Meseguer-RTA00, author={Meseguer, J.}, title={{Rewriting Logic and Maude: Concepts and Applications (invited lecture)}}, pages={1--26}, crossref={RTA00} } @InProceedings{Voronkov-RTA00, author={Voronkov, A.}, title={{Formulae over Reduction Orderings: Some Solved and yet Unsolved Problems (invited lecture)}}, crossref={RTA00} } @InProceedings{Miller-RTA00, author={Miller, D.}, title={{Abstract Syntax for Variable Binders (invited lecture)}}, crossref={RTA00} } @InProceedings{Tison-RTA00, author={Tison, S.}, title={{Tree Automata and Term Rewrite Systems (invited tutorial)}}, pages={27--30}, crossref={RTA00} } @InProceedings{BjornerM-RTA00, author={Bj{\o}rner, N. and Mu\~noz, C.}, title={{Absolute Explicit Unification}}, pages={31--46}, crossref={RTA00} } @InProceedings{Blanqui-RTA00, author={Blanqui, F.}, title={{Termination and Confluence of Higher-Order Rewrite Systems}}, pages={47--61}, crossref={RTA00} } @InProceedings{BonelliKR-RTA00, author={Bonelli, E. and Kesner, D. and R\'{\i}os, A.}, title={{A de Bruijn Notation for Higher-Order Rewriting}}, pages={62--79}, crossref={RTA00} } @InProceedings{ContejeanCM-RTA00, author={Contejean, E. and Coste, A. and Monate, B.}, title={{Rewriting Techniques Applied to Theoretical Physics}}, pages={80--94}, crossref={RTA00} } @InProceedings{DoughertyG-RTA00, author={Dougherty, D. and Guti\'errez, C.}, title={{Normal Forms and Reduction for Theories of Binary Relations}}, pages={95--109}, crossref={RTA00} } @InProceedings{ErkN-RTA00, author={Erk, K. and Niehren, J.}, title={{Parallelism Constraints}}, pages={110--126}, crossref={RTA00} } @InProceedings{deGroote-RTA00, author={de Groote, P.}, title={{Higher-Order Linear Matching is NP-Complete}}, pages={127--140}, crossref={RTA00} } @InProceedings{JoachimskiM-RTA00, author={Joachimski, F. and Matthes, R.}, title={{Standardization and Confluence for a Lambda Calculus with Generalized Applications}}, pages={141--155}, crossref={RTA00} } @InProceedings{LevyV-RTA00, author={Levy, J. and Villaret, M.}, title={{Linear Second-Order Unification and Context Unification with Tree-Regular Constraints}}, pages={156--171}, crossref={RTA00} } @InProceedings{Lohrey-RTA00, author={Lohrey, M.}, title={{Word Problems and Confluence Problems for Restricted Semi-Thue Systems}}, pages={172--186}, crossref={RTA00} } @InProceedings{Pichler-RTA00, author={Pichler, R.}, title={{The Explicit Representability of Implicit Generalizations}}, pages={187--202}, crossref={RTA00} } @InProceedings{Statman-RTA00, author={Statman, R.}, title={{On the Word Problem for Combinators}}, pages={203--213}, crossref={RTA00} } @InProceedings{Struth-RTA00, author={Struth, G.}, title={{An Algebra of Resolution}}, pages={214--228}, crossref={RTA00} } @InProceedings{Stuber-RTA00, author={Stuber, J.}, title={{Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems}}, pages={229--245}, crossref={RTA00} } @InProceedings{TakaiKS-RTA00, author={Takai, T. and Kaji, Y. and Seki, H.}, title={{Right-Linear Finite Overlapping Term Rewriting Systems Effectively Preserve Recognizability}}, pages={246--260}, crossref={RTA00} } @InProceedings{Arts-RTA00, author={Arts, T.}, title={{System Description: The Dependency Pair Method}}, pages={261--264}, crossref={RTA00} } @InProceedings{Moreau-RTA00, author={Moreau, P.-E.}, title={{REM (Reduce Elan Machine): Core of the New ELAN Compiler (system description)}}, pages={265--269}, crossref={RTA00} } @InProceedings{OhlebuschCM-RTA00, author={Ohlebusch, E. and Claves, C. and March\'e, C.}, title={{TALP: A Tool for the Termination Analysis of Logic Programs (system description)}}, pages={270--273}, crossref={RTA00} } % CROSSREFERENCES % These must remain at the end of this file. @Proceedings{RTA00, year={2000}, month=jul # {~10--12,}, editor={Bachmair, Leo}, title={{Rewriting Techniques and Applications, 11th International Conference, RTA-00}}, booktitle={{Rewriting Techniques and Applications, 11th International Conference, RTA-00}}, address={Norwich, U.K.}, series={LNCS 1833}, publisher={Springer-Verlag} }