Rewriting Techniques and Applications

This volume contains the proceedings of the 11th International Conference on Rewriting Techniques and Applications. The conference was held July 10-12, 2000,attheUniversityofEastAnglia,Norwich,U. K. Itisthemajorforumfor thepresentationofresearchonalltheoreticalandpracticalaspectsofrewriting. InformationaboutpreviousRTAconferencescanbefoundat loria. fr/rta/ andinformationaboutthegeneralresearchareaofrewritingat loria. fr/vigneron/RewritingHP/ Theprogramcommitteeselected18papers,includingthreesystemdescr- tions, from a total of 44 submissions. In addition the program included invited talksbyJoseMeseguer,DaleMiller,andAndreiVoronkov;andaninvitedtu- rialbySophieTison. ManypeoplecontributedtoRTA-2000andIwouldliketoexpressmysincere thanks to all of them. I am grateful to the program committee members and the external referees for reviewing the submissions and maintaining the high standard of the RTA conferences; to Richard Kennaway, who was responsible for the local arrangements for the conference; and to Jos e Meseguer, the RTA publicitychair. ItisaparticularpleasuretothankAshishTiwariforhisextensive assistance in many of my tasks as the program chair. Finally, I wish to thank the School of Information Systems at the University of East Anglia both for ?nancialsupportandforprovidingthefacilities. May2000 LeoBachmair VI Organization ConferenceOrganization ProgramChair LeoBachmair(StonyBrook) ProgramCommittee FranzBaader(Aachen) GillesDowek(Rocquencourt) NeilGhani(Leicester) JuergenGiesl(Albuquerque) Jean-PierreJouannaud(Orsay) ChrisLynch(Potsdam,NewYork) AartMiddeldorp(Tsukuba) MitsuhiroOkada(Tokyo) FemkevanRaamsdonk(Amsterdam) AlbertRubio(Barcelona) YoshihitoToyama(Tatsunokuchi) RakeshVerma(Houston) LocalArrangementsChair RichardKennaway(Norwich) PublicityChair Jos eMeseguer(MenloPark) RTAOrganizingCommittee HubertComon(Cachan) TobiasNipkow(Munich) NachumDershowitz,chair(Urbana) MichaelRusinowitch(Nancy) Jos eMeseguer(MenloPark) YoshihitoToyama(Tatsunokuchi) External Referees VII ExternalReferees Y. Akama T. Aoto T. Arts F. Blanqui R. Bloo A. Boudet J. Chrzaszcz E. Contejean D. Dougherty K. Erk M. Fernandez W. Fokkink G. Godoy B. Gramlich T. Ida F. Jacquemard S. Kahrs Y. Kaji D. Kesner K. Kusakari F. Lang C. Luth M. Leucker J. Levy R. Matthes R. Mayr B. Monate J. J. MorenoNavarro M. Nagayama P. Narendran J. Niehren R. Nieuwenhuis K. Ogata E. Ohlebusch S. Okui C. -H. L.

Includes supplementary material: sn.pub/extras

Klappentext

RichardKennaway(Norwich) PublicityChair Jos eMeseguer(MenloPark) RTAOrganizingCommittee HubertComon(Cachan) TobiasNipkow(Munich) NachumDershowitz,chair(Urbana) MichaelRusinowitch(Nancy) Jos eMeseguer(MenloPark) YoshihitoToyama(Tatsunokuchi) External Referees VII ExternalReferees Y. Akama T. Aoto T. Arts F. Blanqui R. Bloo A. Boudet J. Chrzaszcz E. Contejean D. Dougherty K. Erk M. Fernandez W. Fokkink G. Godoy B. Gramlich T. Ida F. Jacquemard S. Kahrs Y. Kaji D. Kesner K. Kusakari F. Lang C. Luth M. Leucker J. Levy R. Matthes R. Mayr B. Monate J. J. MorenoNavarro M. Nagayama P. Narendran J. Niehren R. Nieuwenhuis K. Ogata E. Ohlebusch S. Okui C. -H. L.

Inhalt
Invited Talk.- Rewriting Logic and Maude: Concepts and Applications.- Invited Tutorial.- Tree Automata and Term Rewrite Systems.- Regular Papers.- Absolute Explicit Unification.- Termination and Confluence of Higher-Order Rewrite Systems.- A de Bruijn Notation for Higher-Order Rewriting.- Rewriting Techniques in Theoretical Physics.- Normal Forms and Reduction for Theories of Binary Relations.- Parallelism Constraints.- Linear Higher-Order Matching Is NP-Complete.- Standardization and Confluence for a Lambda Calculus with Generalized Applications.- Linear Second-Order Unification and Context Unification with Tree-Regular Constraints.- Word Problems and Confluence Problems for Restricted Semi-Thue Systems.- The Explicit Representability of Implicit Generalizations.- On the Word Problem for Combinators.- An Algebra of Resolution.- Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems.- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability.- System Descriptions.- System Description: The Dependency Pair Method.- REM (Reduce Elan Machine): Core of the New ELAN Compiler.- TALP: A Tool for the Termination Analysis of Logic Programs.