Sophie Tison – författare

This volume contains the proceedings of the 13th International Conference on Rewriting Techniques and Applications (RTA 2002),which was held July 22- 24,2002 in Copenhagen as part of the 3rd Federated Logic Conference (FLoC 2002). RTA is the ma jor international forum for the presentation of research on all aspects of rewriting. Previous RTA conferences took place in Dijon (1985), Bordeaux (1987),Chapel Hill (1989),Como (1991),Montreal (1993),Kaise- lautern (1995),Rutgers (1996),Sitges (1997),Tsukuba (1998),Trento (1999), Norwich (2000),and Utrecht (2001). A total of 20 regular papers,2 application papers and 4 system descriptions were selected for presentation from 49 submissions from Argentina (1),Brazil 2 1 5 ( ),Czech Republic (1),France (13),Germany (8),Israel ( ),Italy (1 ),Japan 3 3 6 1 (6),The Netherlands (2),Poland (1),Portugal (1 ),Rumania (1),Spain (4),UK 3 5 1 1 ( ),Uruguay ( ),USA (5 ),Venezuela (1). The program committee awarded 6 2 2 the best paper prize to Paul-Andr' e Melli' es for his paper Residual Theory Re- sited. This paper presents an elegant and subtle generalization of Jean-Jacques L' evy's residual theory.I am especially grateful to the invited speakers Franz Baader,John Mitchell, and Natara jan Shankar for accepting our invitation to present us their insights into their research areas.

This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.

The Symposium on Theoretical Aspects of Computer Science (STACS) is held annually, alternating between France and Germany. The current volume cons- tutes the proceedings of the 16th STACS conference, organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft fur .. Informatik (GI) in Germany, and Maison de l'Informatique et des Math e- tiques Discr etes (MIMD) in France. The conference took place in Trier { the oldest town in Germany, with more than 2 millennia of history. Previous symposia of the series were held in Paris (1984), Saarbru cken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wur .. zburg (1993), Caen (1994), Mu nchen (1995), Grenoble (1996), Lu beck (1997), and Paris (1998). All proceedings of the series have been published in the Lecture Notes of Computer Science series of Springer-Verlag. STACShasbecome oneofthe mostimportantannualmeetingsin Europefor the theoretical computer science community. This time, altogether 300 authors from36countriesonv econtinentssubmittedtheirpapers.Eachsubmissionwas sent to v e members of the program committee for review.During the program committee session 51 out of the 146 submissions were accepted for presen- tion. In two of the selected papers the same result was proved independently.