Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)Hélène Kirchner. 1-4 [doi]
- Matching Logic - Extended Abstract (Invited Talk)Grigore Rosu. 5-21 [doi]
- Executable Formal Models in Rewriting Logic (Invited Talk)Carolyn Talcott. 22-22 [doi]
- Certification of Complexity Proofs using CeTAMartin Avanzini, Christian Sternagel, René Thiemann. 23-39 [doi]
- Dismatching and Local Disunification in ELFranz Baader, Stefan Borgwardt, Barbara Morawska. 40-56 [doi]
- Nominal Anti-UnificationAlexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret. 57-73 [doi]
- A faithful encoding of programmable strategies into term rewriting systemsHoratiu Cirstea, Sergueï Lenglet, Pierre-Etienne Moreau. 74-88 [doi]
- Presenting a Category Modulo a Rewriting SystemFlorence Clerc, Samuel Mimram. 89-105 [doi]
- Confluence of nearly orthogonal infinitary term rewriting systemsLukasz Czajka. 106-126 [doi]
- No complete linear term rewriting system for propositional logicAnupam Das, Lutz Straßburger. 127-142 [doi]
- A Coinductive Framework for Infinitary Rewriting and Equational ReasoningJörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva 0001. 143-159 [doi]
- Proving non-termination by finite automataJörg Endrullis, Hans Zantema. 160-176 [doi]
- Reachability Analysis of Innermost RewritingThomas Genet, Yann Salmon. 177-193 [doi]
- Network Rewriting II: Bi- and Hopf AlgebrasLars Hellström. 194-208 [doi]
- Leftmost Outermost RevisitedNao Hirokawa, Aart Middeldorp, Georg Moser. 209-222 [doi]
- Conditional ComplexityCynthia Kop, Aart Middeldorp, Thomas Sternagel. 223-240 [doi]
- Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational UnificationIlias S. Kotsireas, Temur Kutsia, Dimitris E. Simos. 241-256 [doi]
- Improving Automatic Confluence Analysis of Rewrite Systems by Redundant RulesJulian Nagele, Bertram Felgenhauer, Aart Middeldorp. 257-268 [doi]
- Certified Rule LabelingJulian Nagele, Harald Zankl. 269-284 [doi]
- Transforming Cycle Rewriting into String RewritingDavid Sabel, Hans Zantema. 285-300 [doi]
- Confluence of Orthogonal Nominal Rewriting Systems RevisitedTakaki Suzuki, Kentaro Kikuchi, Takahito Aoto 0001, Yoshihito Toyama. 301-317 [doi]
- Matrix Interpretations on Polyhedral DomainsJohannes Waldmann. 318-333 [doi]
- Inferring Lower Bounds for Runtime ComplexityFlorian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. 334-349 [doi]
- A Simple and Efficient Step Towards Type-Correct XSLT TransformationsMarkus Lepper, Baltasar Trancón-y-Widemann. 350-364 [doi]
- DynSem: A DSL for Dynamic Semantics SpecificationVlad A. Vergu, Pierre Néron, Eelco Visser. 365-378 [doi]