Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings. (Q704166): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:54, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings. |
scientific article |
Statements
Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings. (English)
0 references
13 January 2005
0 references
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]
0 references