Abstract is missing.
- PrefaceChristopher Lynch. [doi]
- Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List)Christopher Lynch. [doi]
- Automata for Data Words and Data TreesMikolaj Bojanczyk. 1-4 [doi]
- Realising Optimal SharingVincent van Oostrom. 5-6 [doi]
- Automated Confluence Proof by Decreasing Diagrams based on Rule-LabellingTakahito Aoto. 7-16 [doi]
- Higher-Order (Non-)Modularity Claus Appel, Vincent van Oostrom, Jakob Grue Simonsen. 17-32 [doi]
- Closing the Gap Between Runtime Complexity and Polytime ComputabilityMartin Avanzini, Georg Moser. 33-48 [doi]
- Abstract Models of Transfinite ReductionsPatrick Bahr. 49-66 [doi]
- Partial Order Infinitary Term Rewriting and Böhm TreesPatrick Bahr. 67-84 [doi]
- Unique Normal Forms in Infinitary Weakly Orthogonal RewritingJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom. 85-102 [doi]
- The Undecidability of Type Related Problems in Type-free Style System FKen-etsu Fujita, Aleksy Schubert. 103-118 [doi]
- On (Un)Soundness of UnravelingsKarl Gmeiner, Bernhard Gramlich, Felix Schernhammer. 119-134 [doi]
- A Proof Calculus Which Reduces Syntactic BureaucracyAlessio Guglielmi, Tom Gundersen, Michel Parigot. 135-150 [doi]
- A Rewriting Logic Semantics Approach to Modular Program AnalysisMark Hills, Grigore Rosu. 151-160 [doi]
- Infinitary Rewriting: Foundations RevisitedStefan Kahrs. 161-176 [doi]
- Underspecified computation of normal formsAlexander Koller, Stefan Thater. 177-192 [doi]
- Order-Sorted Unification with Regular Expression SortsTemur Kutsia, Mircea Marin. 193-208 [doi]
- An Efficient Nominal Unification AlgorithmJordi Levy, Mateu Villaret. 209-226 [doi]
- Computing Critical Pairs in 2-Dimensional Rewriting SystemsSamuel Mimram. 227-242 [doi]
- Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the IntegersFriedrich Neurauter, Aart Middeldorp. 243-258 [doi]
- Automated Termination Analysis of Java Bytecode by Term RewritingCarsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl. 259-276 [doi]
- Declarative Debugging of Missing Answers for MaudeAdrián Riesco, Alberto Verdejo, Narciso Martí-Oliet. 277-294 [doi]
- Simulation in the Call-by-Need Lambda-Calculus with letrecManfred Schmidt-Schauß, David Sabel, Elena Machkasova. 295-310 [doi]
- Weak Convergence and Uniform Normalization in Infinitary RewritingJakob Grue Simonsen. 311-324 [doi]
- Certified Subterm Criterion and Certified Usable RulesChristian Sternagel, René Thiemann. 325-340 [doi]
- Termination of linear bounded term rewriting systemsIrène Durand, Géraud Sénizergues, Marc Sylvestre. 341-356 [doi]
- Polynomially Bounded Matrix InterpretationsJohannes Waldmann. 357-372 [doi]
- Optimizing mkbTTSarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara. 373-384 [doi]
- Modular Complexity Analysis via Relative ComplexityHarald Zankl, Martin Korp. 385-400 [doi]
- Proving Productivity in Infinite Data StructuresHans Zantema, Matthias Raffelsieper. 401-416 [doi]