Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.

DOI10.1007/B98160MaRDI QIDQ704166zbMATH OpenOpenAlexFDO

Authors

Publication date 13 January 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98160

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Grammars and rewriting systems (68Q42)

Review text

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1029.00060). Indexed articles: \textit{Jones, Neil D.; Bohr, Nina}, Termination analysis of the untyped \(\lambda \)-calculus, 1-23 [Zbl 1187.68127] \textit{Blanqui, Frédéric}, A type-based termination criterion for dependently-typed higher-order rewrite systems, 24-39 [Zbl 1187.68273] \textit{Toyama, Yoshihito}, Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms, 40-54 [Zbl 1187.68284] \textit{Levy, Jordi; Schmidt-Schauß, Manfred; Villaret, Mateu}, Monadic second-order unification is NP-complete, 55-69 [Zbl 1187.68278] \textit{Contejean, Evelyne}, A certified AC matching algorithm, 70-84 [Zbl 1187.68524] \textit{Carme, Julien; Niehren, Joachim; Tommasi, Marc}, Querying unranked trees with stepwise tree automata, 105-118 [Zbl 1187.68188] \textit{Takai, Toshinori}, A verification technique using term rewriting systems and abstract interpretation, 119-133 [Zbl 1187.68319] \textit{Geuvers, Herman; Nederpelt, Rob}, Rewriting for Fitch style natural deductions, 134-154 [Zbl 1187.03045] \textit{Mackie, Ian}, Efficient \(\lambda \)-evaluation with interaction nets, 155-169 [Zbl 1187.68280] \textit{Limet, Sébastien; Salzer, Gernot}, Proving properties of term rewrite systems via logic programs, 170-184 [Zbl 1187.68279] \textit{Simonsen, Jakob Grue}, On the modularity of confluence in infinitary term rewriting, 185-199 [Zbl 1187.68283] \textit{Blom, Stefan}, An approximation based approach to infinitary lambda calculi, 221-232 [Zbl 1187.03013] \textit{Ketema, Jeroen}, Böhm-like trees for term rewriting systems, 233-248 [Zbl 1187.68276] \textit{Hirokawa, Nao; Middeldorp, Aart}, Dependency pairs revisited, 249-268 [Zbl 1187.68275] \textit{Aoto, Takahito; Yamada, Toshiyuki; Toyama, Yoshihito}, Inductive theorems for higher-order rewriting, 269-284 [Zbl 1187.68272] \textit{Mitsuhashi, Ichiro; Oyamaguchi, Michio; Ohta, Yoshikatsu; Yamada, Toshiyuki}, The joinability and unification problems for confluent semi-constructor TRSs, 285-300 [Zbl 1187.68281]

Recommendations

• Rewriting techniques and applications. 6th international conference, RTA-95, Kaiserslautern, Germany, April 5--7, 1995. Proceedings
• Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15--17, 2008. Proceedings
• Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings
• Rewriting techniques and applications. 12th international conference, RTA 2001, Utrecht, The Netherlands, May 22--24, 2001. Proceedings
• Rewriting techniques and applications. 11th international conference, RTA 2000, Norwich, GB, July 10--12, 2000. Proceedings
• Rewriting techniques and applications. 13th international conference, RTA 2002, Copenhagen, Denmark, July 22--24, 2002. Proceedings
• Rewriting techniques and applications. 10th international conference, RTA-99. Trento, Italy, July 2--4, 1999. Proceedings
• Rewriting techniques and applications. 4th international conference, RTA-91, Como, Italy, April 10--12, 1991. Proceedings
• Rewriting techniques and applications. 8th international conference, RTA '97, Sitges, Spain, June 2--5, 1997. Proceedings
• Rewriting techniques and applications. 5th international conference RTA-93, Montréal, Canada, June 16--18, 1993. Proceedings

Cited in

(4)

• Operational termination of membership equational programs: the order-sorted way
• Proving termination of context-sensitive rewriting by transformation
• Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15--17, 2008. Proceedings
• Loop detection in term rewriting using the eliminating unfoldings

This page was built for publication: Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704166)