Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference OrganizationManfred Schmidt-Schauß. [doi]
- Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What s New?Sophie Tison. 1-2 [doi]
- Rewriting in PracticeAshish Tiwari. 3-8 [doi]
- Combining Proofs and ProgramsStephanie Weirich. 9-9 [doi]
- FAST: An Efficient Decision Procedure for Deduction and Static EquivalenceBruno Conchinha, David A. Basin, Carlos Caleiro. 11-20 [doi]
- Automated Certified Proofs with CiME3Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain. 21-30 [doi]
- Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6Francisco Durán, Steven Eker, Santiago Escobar, José Meseguer, Carolyn L. Talcott. 31-40 [doi]
- Termination Analysis of C Programs Using Compiler Intermediate LanguagesStephan Falke, Deepak Kapur, Carsten Sinz. 41-50 [doi]
- First-Order Unification on Compressed TermsAdria Gascón, Sebastian Maneth, Lander Ramos. 51-60 [doi]
- Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda CalculusNiels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, Jakob Grue Simonsen. 61-70 [doi]
- Maximal CompletionDominik Klein, Nao Hirokawa. 71-80 [doi]
- CRSX - Combinatory Reduction Systems with ExtensionsKristoffer H. Rose. 81-90 [doi]
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting SystemsTakahito Aoto, Yoshihito Toyama. 91-106 [doi]
- Natural Inductive Theorems for Higher-Order RewritingTakahito Aoto, Toshiyuki Yamada, Yuki Chiba. 107-121 [doi]
- A Path Order for Rewrite Systems that Compute Exponential Time FunctionsMartin Avanzini, Naohi Eguchi, Georg Moser. 123-138 [doi]
- Modes of Convergence for Term Graph RewritingPatrick Bahr. 139-154 [doi]
- Modular Termination Proofs of Recursive Java Bytecode Programs by Term RewritingMarc Brockschmidt, Carsten Otto, Jürgen Giesl. 155-170 [doi]
- Rewriting-based Quantifier-free Interpolation for a Theory of ArraysRoberto Bruttomesso, Silvio Ghilardi, Silvio Ranise. 171-186 [doi]
- Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree GrammarsJonathan Kochems, C.-H. Luke Ong. 187-202 [doi]
- Higher Order Dependency Pairs for Algebraic Functional SystemsCynthia Kop, Femke van Raamsdonk. 203-218 [doi]
- Anti-Unification for Unranked Terms and HedgesTemur Kutsia, Jordi Levy, Mateu Villaret. 219-234 [doi]
- Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational ComplexityGeorg Moser, Andreas Schnabl. 235-250 [doi]
- Revisiting Matrix Interpretations for Proving Termination of Term RewritingFriedrich Neurauter, Aart Middeldorp. 251-266 [doi]
- Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to LinearityNaoki Nishida, Masahiko Sakai, Toshiki Sakabe. 267-282 [doi]
- Program Inversion for Tail Recursive FunctionsNaoki Nishida, Germán Vidal. 283-298 [doi]
- Refinement Types as Higher-Order Dependency PairsCody Roux. 299-312 [doi]
- Weakening the Axiom of Overlap in Infinitary Lambda CalculusPaula Severi, Fer-Jan de Vries. 313-328 [doi]
- Modular and Certified Semantic Labeling and UnlabelingChristian Sternagel, René Thiemann. 329-344 [doi]
- Type Preservation as a Confluence ProblemAaron Stump, Garrin Kimmell, Roba El Haj Omar. 345-360 [doi]
- Left-linear Bounded TRSs are Inverse Recognizability PreservingIrène Durand, Marc Sylvestre. 361-376 [doi]
- Labelings for Decreasing DiagramsHarald Zankl, Bertram Felgenhauer, Aart Middeldorp. 377-392 [doi]
- Proving Equality of Streams AutomaticallyHans Zantema, Jörg Endrullis. 393-408 [doi]