Abstract is missing.
- Modular Termination of Basic NarrowingMaría Alpuente, Santiago Escobar, José Iborra. 1-16 [doi]
- Linear-algebraic lambda-calculus: higher-order, encodings, and confluence.Pablo Arrighi, Gilles Dowek. 17-31 [doi]
- Term-Graph Rewriting Via Explicit PathsEmilie Balland, Pierre-Etienne Moreau. 32-47 [doi]
- Finer Is Better: Abstraction Refinement for Rewriting ApproximationsYohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko. 48-62 [doi]
- A Needed Rewriting Strategy for Data-Structures with PointersRachid Echahed, Nicolas Peltier. 63-78 [doi]
- Effectively Checking the Finite Variant PropertySantiago Escobar, José Meseguer, Ralf Sasse. 79-93 [doi]
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data StructuresStephan Falke, Deepak Kapur. 94-109 [doi]
- Maximal TerminationCarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. 110-125 [doi]
- Usable Rules for Context-Sensitive Rewrite SystemsRaúl Gutiérrez, Salvador Lucas, Xavier Urbain. 126-141 [doi]
- Combining Equational Tree Automata over AC and ACI TheoriesJoe Hendrix, Hitoshi Ohsaki. 142-156 [doi]
- Closure of Hedge-Automata Languages by Hedge RewritingFlorent Jacquemard, Michaël Rusinowitch. 157-171 [doi]
- On Normalisation of Infinitary Combinatory Reduction SystemsJeroen Ketema. 172-186 [doi]
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting SystemsYoshiharu Kojima, Masahiko Sakai. 187-201 [doi]
- Arctic Termination ...Below ZeroAdam Koprowski, Johannes Waldmann. 202-216 [doi]
- Logics and Automata for Totally Ordered TreesMarco Kuhlmann, Joachim Niehren. 217-231 [doi]
- Diagram Rewriting for Orthogonal Matrices: A Study of Critical PeaksYves Lafont, Pierre Rannou. 232-245 [doi]
- Nominal Unification from a Higher-Order PerspectiveJordi Levy, Mateu Villaret. 246-260 [doi]
- Functional-Logic Graph Parser CombinatorsSteffen Mazanek, Mark Minas. 261-275 [doi]
- Proving Quadratic Derivational Complexities Using Context Dependent InterpretationsGeorg Moser, Andreas Schnabl. 276-290 [doi]
- Tree Automata for Non-linear ArithmeticNaoki Kobayashi, Hitoshi Ohsaki. 291-305 [doi]
- Confluence by Decreasing DiagramsVincent van Oostrom. 306-320 [doi]
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and CaseManfred Schmidt-Schauß, Elena Machkasova. 321-335 [doi]
- Root-LabelingChristian Sternagel, Aart Middeldorp. 336-350 [doi]
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable EqualitiesSorin Stratulat. 351-365 [doi]
- Deciding Innermost LoopsRené Thiemann, Jürgen Giesl, Peter Schneider-Kamp. 366-380 [doi]
- Termination Proof of S-Expression Rewriting Systems with Recursive Path RelationsYoshihito Toyama. 381-391 [doi]
- Encoding the Pure Lambda Calculus into Hierarchical Graph RewritingKazunori Ueda. 392-408 [doi]
- Revisiting Cut-Elimination: One Difficult Proof Is Really a ProofChristian Urban, Bozhi Zhu. 409-424 [doi]
- Reduction Under SubstitutionJörg Endrullis, Roel C. de Vrijer. 425-440 [doi]
- Normalization of Infinite TermsHans Zantema. 441-455 [doi]