Rewriting techniques and applications. 13th international conference, RTA 2002, Copenhagen, Denmark, July 22--24, 2002. Proceedings (Q1611726)

The articles of this volume will be reviewed individually. The preceding conference (12th, 2001) has been reviewed (see Zbl 0967.00070). Indexed articles: \textit{Shankar, Natarajan; Rueß, Harald}, Combining Shostak theories, 1-18 [Zbl 1045.03015] \textit{Mitchell, John C.}, Multiset rewriting and security protocol analysis, 19-22 [Zbl 1045.68582] \textit{Baader, Franz}, Engineering of logics for the content-based representation of information, 23 [Zbl 1045.03512] \textit{Melliès, Paul-André}, Axiomatic rewriting theory. VI: Residual theory revisited., 24-50 [Zbl 1045.68075] \textit{Kennaway, Richard; Khasidashvili, Zurab; Piperno, Adolfo}, Static analysis of modularity of \(\beta\)-reduction in the hyperbalanced \(\lambda\)-calculus., 51-65 [Zbl 1045.03018] \textit{Faure, Germain; Kirchner, Claude}, Exceptions in the rewriting calculus, 66-82 [Zbl 1045.68069] \textit{Struth, Georg}, Deriving focused lattice calculi., 83-97 [Zbl 1045.03016] \textit{Seki, Hiroyuki; Takai, Toshinori; Fujinaka, Youhei; Kaji, Yuichi}, Layered transducing term rewriting system and its recognizability preserving property, 98-113 [Zbl 1045.68076] \textit{Ohsaki, Hitoshi; Takai, Toshinori}, Decidability and closure properties of equational tree languages, 114-128 [Zbl 1045.68083] \textit{Réty, Pierre; Vuotto, Julie}, Regular sets of descendants by some rewrite strategies, 129-143 [Zbl 1045.68085] \textit{Waldmann, Johannes}, Rewrite games, 144-158 [Zbl 1045.68078] \textit{Severi, Paula; de Vries, Fer-Jan}, An extensional Böhm model, 159-173 [Zbl 1169.03329] \textit{Forest, Julien}, A weak calculus with explicit operators for pattern matching and substitution, 174-191 [Zbl 1045.68070] \textit{Liang, Chuck; Nadathur, Gopalan}, Tradeoffs in the intensional representation of lambda terms, 192-206 [Zbl 1045.68530] \textit{Déharbe, David; Moreira, Anamaria Martins; Ringeissen, Christophe}, Improving symbolic model checking by rewriting temporal logic formulae, 207-221 [Zbl 1045.68091] \textit{Voigtländer, Janis}, Conditions for efficiency improvement by tree transducer composition, 222-236 [Zbl 1045.68040] \textit{Bravenboer, Martin; Visser, Eelco}, Rewriting strategies for instruction selection, 237-251 [Zbl 1045.68578] \textit{Bournez, Olivier; Kirchner, Claude}, Probabilistic rewrite strategies. Applications to ELAN, 252-266 [Zbl 1045.68577] \textit{Geser, Alfons}, Loops of superexponential lengths in one-rule string rewriting, 267-280 [Zbl 1045.68071] \textit{Tahhan-Bittar, Elias}, Recursive derivational length bounds for confluent term rewrite systems, 281-295 [Zbl 1045.68077] \textit{Lucas, Salvador}, Termination of (canonical) context-sensitive rewriting, 296-310 [Zbl 1045.68074] \textit{Charatonik, Witold; Talbot, Jean-Marc}, Atomic set constraints with projection, 311-325 [Zbl 1045.68064] \textit{Levy, Jordi; Villaret, Mateu}, Currying second-order unification problems, 326-339 [Zbl 1045.68073] \textit{Dougherty, Dan; Wierzbicki, Tomasz}, A decidable variant of higher order matching, 340-351 [Zbl 1045.68068] \textit{Baader, Franz; Tinelli, Cesare}, Combining decision procedures for positive theories sharing constructors, 352-366 [Zbl 1045.03013] \textit{van de Pol, Jaco}, JITty: A rewriter with strategy annotations, 367-370 [Zbl 1045.68583] \textit{Durand, Irène}, Autowrite: A tool for checking properties of term rewriting systems, 371-375 [Zbl 1045.68579] \textit{Lecland, Benoit; Réty, Pierre}, TTSLI: An implementation of tree-tuple synchronized languages, 376-379 [Zbl 1045.68581] \textit{Lippi, Sylvain}, in\({}^2\): A graphical interpreter for interaction nets, 380-385 [Zbl 1045.68593]