Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings (Q1418343): Difference between revisions

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0992.00043). Indexed articles: \textit{Lincoln, Patrick}, Symbolic systems biology, 1 [Zbl 1038.68775] \textit{Dowek, Gilles}, Confluence as a cut elimination property, 2-13 [Zbl 1038.03054] \textit{Eker, Steven}, Associative-commutative rewriting on large terms, 14-29 [Zbl 1038.68560] \textit{Bournez, Olivier; Côme, Guy-Marie; Conraud, Valérie; Kirchner, Hélène; Ibănescu, Liliana}, A rule-based approach for automated generation of kinetic chemical mechanisms, 30-45 [Zbl 1038.68558] \textit{Sinot, François-Régis; Fernández, Maribel; Mackie, Ian}, Efficient reductions with director strings, 46-60 [Zbl 1038.68025] \textit{Bournez, Olivier; Hoyrup, Mathieu}, Rewriting logic and probabilities, 61-75 [Zbl 1038.68063] \textit{Clavel, Manuel; Durán, Francisco; Eker, Steven; Lincoln, Patrick; Martí-Oliet, Narciso; Meseguer, José; Talcott, Carolyn}, The Maude 2.0 system, 76-87 [Zbl 1038.68559] \textit{Wells, Joe B.; Plump, Detlef; Kamareddine, Fairouz}, Diagrams for meaning preservation, 88-106 [Zbl 1038.68073] \textit{Forest, Julien; Kesner, Delia}, Expression reduction systems with patterns, 107-122 [Zbl 1038.68064] \textit{Sander Bruggink, H. J.}, Residuals in higher-order rewriting, 123-137 [Zbl 1038.68071] \textit{Granicz, Adam; Zimmerman, Daniel M.; Hickey, Jason}, Rewriting UNITY, 138-147 [Zbl 1038.68542] \textit{Comon-Lundh, Hubert; Cortier, Véronique}, New decidability results for fragments of first-order logic and application to cryptographic protocols, 148-164 [Zbl 1038.03012] \textit{Kapur, Deepak; Narendran, Paliath; Wang, Lida}, An E-unification algorithm for analyzing protocols that use modular exponentiation, 165-179 [Zbl 1043.94537] \textit{Verma, Kumar Neeraj}, Two-way equational tree automata for AC-like theories: Decidability and closure properties, 180-196 [Zbl 1038.03047] \textit{Chen, Feng; Roşu, Grigore; Venkatesan, Ram Prasad}, Rule-based analysis of dimensional safety, 197-207 [Zbl 1038.68548] \textit{Giavitto, Jean-Louis}, Topological collections, transformations and their application to the modeling and the simulation of dynamical systems, 208-233 [Zbl 1038.68066] \textit{Salvati, Sylvain; de Groote, Philippe}, On the complexity of higher-order matching in the linear \(\lambda\)-calculus, 234-245 [Zbl 1038.03014] \textit{Dal Zilio, Silvano; Lugiez, Denis}, XML schema, tree logic and sheaves automata, 246-263 [Zbl 1038.68039] \textit{Thiemann, René; Giesl, Jürgen}, Size-change termination for term rewriting, 264-278 [Zbl 1038.68072] \textit{Borralleras, Cristina; Rubio, Albert}, Monotonic AC-compatible semantic path orderings, 279-295 [Zbl 1038.68062] \textit{Moser, Georg; Weiermann, Andreas}, Relating derivation lengths with the slow-growing hierarchy directly, 296-310 [Zbl 1038.68069] \textit{Hirokawa, Nao; Middeldorp, Aart}, Tsukuba termination tool, 311-320 [Zbl 1038.68561] \textit{Giesl, Jürgen; Zantema, Hans}, Liveness in rewriting, 321-336 [Zbl 1038.68067] \textit{Barthe, Gilles; Stratulat, Sorin}, Validation of the JavaCard platform with implicit induction techniques, 337-351 [Zbl 1038.68557] \textit{Urso, Pascal; Kounalis, Emmanuel}, ``Term partition'' for mathematical induction, 352-366 [Zbl 1038.68111] \textit{Kutsia, Temur}, Equational prover of THEOREMA, 367-379 [Zbl 1038.68570] \textit{Aoto, Takahito; Yamada, Toshiyuki}, Termination of simply typed term rewriting by translation and labelling, 380-394 [Zbl 1038.68060] \textit{Blanqui, Frédéric}, Rewriting modulo in deduction modulo, 395-409 [Zbl 1038.68061] \textit{Geser, Alfons}, Termination of string rewriting rules that have one pair of overlaps, 410-423 [Zbl 1038.68065] \textit{van den Brand, Mark; Moreau, Pierre-Etienne; Vinju, Jurgen}, Environments for term rewriting engines for free!, 424-435 [Zbl 1038.68563] \textit{McAllester, David}, A logical algorithm for ML type inference, 436-451 [Zbl 1038.68543] \textit{Ghani, Neil; Heyworth, Anne}, A rewriting alternative to Reidemeister-Schreier, 452-466 [Zbl 1038.68152] \textit{Khasidashvili, Zurab; Glauert, John}, Stable computational semantics of conflict-free rewrite systems (partial orders with duplication), 467-482 [Zbl 1038.68068] \textit{Ohsaki, Hitoshi; Seki, Hiroyuki; Takai, Toshinori}, Recognizing Boolean closed A-tree languages with membership conditional rewriting mechanism, 483-498 [Zbl 1038.68070] \textit{Roşu, Grigore; Viswanathan, Mahesh}, Testing extended regular language membership incrementally by rewriting, 499-514 [Zbl 1038.68562]