Theoretical Computer Science Logic, semantics and theory of programming Volume 208, Numbers 1-2, 28 November 1998 Rewriting Techniques and Applications Guest Editor: H. Ganzinger Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts, Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com- pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fir Mathematik Contents Preface H. Ganzinger Contributions K. Madlener and B. Reinert Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings J.-P. Jouannaud and A. Rubio Rewrite orderings for higher-order terms in n-long B-normal form and the recursive path ordering M.R.K. Krishna Rao Modular aspects of term graph rewriting M. Sakai and Y. Toyama Semantics and strong sequentiality of priority term rewriting systems M. Schmidt-SchauB A decision algorithm for distributive unification J. Stuber Superposition theorem proving for abelian groups represented as integer modules R. Treinen The first-order theory of linear one-step rewriting is undecidable Author index volume 208