Abstract is missing.
- Computing and ProvingHenk Barendregt. 1 [doi]
- Rewriting for Deduction and VerificationMichaël Rusinowitch. 2 [doi]
- Universal Interaction Systems with Only Two AgentsDenis Béchet. 3-14 [doi]
- General Recursion on Second Order Term AlgebrasAlessandro Berarducci, Corrado Böhm. 15-30 [doi]
- Beta Reduction ConstraintsManuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. 31-46 [doi]
- From Higher-Order to First-Order RewritingEduardo Bonelli, Delia Kesner, Alejandro Ríos. 47-62 [doi]
- Combining Pattern E-Unification AlgorithmsAlexandre Boudet, Evelyne Contejean. 63-76 [doi]
- Matching PowerHoratiu Cirstea, Claude Kirchner, Luigi Liquori. 77-92 [doi]
- Dependency Pairs for Equational RewritingJürgen Giesl, Deepak Kapur. 93-108 [doi]
- Termination Proofs by Context-Dependent InterpretationsDieter Hofbauer. 108-121 [doi]
- Uniform Normalisation beyond OrthogonalityZurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom. 122-136 [doi]
- Verifying Orientability of Rewrite Rules Using the Knuth-Bendix OrderKonstantin Korovin, Andrei Voronkov. 137-153 [doi]
- Relating Accumulative and Non-accumulative Functional ProgramsArmin Kühnemann, Robert Glück, Kazuhiko Kakehi. 154-168 [doi]
- Context Unification and Traversal EquationsJordi Levy, Mateu Villaret. 169-184 [doi]
- Weakly Regular Relations and ApplicationsSébastien Limet, Pierre Réty, Helmut Seidl. 185-200 [doi]
- On the Parallel Complexity of Tree AutomataMarkus Lohrey. 201-215 [doi]
- Transfinite Rewriting Semantics for Term Rewriting SystemsSalvador Lucas. 216-230 [doi]
- Goal-Directed E-UnificationChristopher Lynch, Barbara Morawska. 231-245 [doi]
- The Unification Problem for Confluent Right-Ground Term Rewriting SystemsMichio Oyamaguchi, Yoshikatsu Ohta. 246-260 [doi]
- On Termination of Higher-Order RewritingFemke van Raamsdonk. 261-275 [doi]
- Matching with Free Function Symbols - A Simple Extension of Matching?Christophe Ringeissen. 276-290 [doi]
- Deriving Focused Calculi for Transitive RelationsGeorg Struth. 291-305 [doi]
- A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable NamesRené Vestergaard, James Brotherston. 306-321 [doi]
- A Normal Form for Church-Rosser Language SystemsJens R. Woinowski. 322-337 [doi]
- Confluence and Termination of Simply Typed Term Rewriting SystemsToshiyuki Yamada. 338-352 [doi]
- Parallel Evaluation of Interaction Nets with MPINEJorge Sousa Pinto. 353-356 [doi]
- Stratego: A Language for Program Transformation Based on Rewriting StrategiesEelco Visser. 357-362 [doi]