Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference Organization [doi]
- Pattern Generation by Cellular Automata (Invited Talk)Jarkko Kari. 1-3 [doi]
- Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)Mitsuhiro Okada. 4-19 [doi]
- Evidence Normalization in System FC (Invited Talk)Dimitrios Vytiniotis, Simon L. Peyton Jones. 20-38 [doi]
- Linear Logic and Strong NormalizationBeniamino Accattoli. 39-54 [doi]
- A Combination Framework for ComplexityMartin Avanzini, Georg Moser. 55-70 [doi]
- Tyrolean Complexity Tool: Features and UsageMartin Avanzini, Georg Moser. 71-80 [doi]
- Abstract Logical Model Checking of Infinite-State Systems Using NarrowingKyungmin Bae, Santiago Escobar, José Meseguer. 81-96 [doi]
- Compression of Rewriting Systems for Termination AnalysisAlexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann. 97-112 [doi]
- A Variant of Higher-Order Anti-UnificationAlexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret. 113-127 [doi]
- Over-approximating Descendants by Synchronized Tree LanguagesYohan Boichut, Jacques Chabin, Pierre Réty. 128-142 [doi]
- Unifying Nominal UnificationChristophe Calvès. 143-157 [doi]
- Rewriting with Linear Inferences in Propositional LogicAnupam Das. 158-173 [doi]
- Proof Orders for Decreasing DiagramsBertram Felgenhauer, Vincent van Oostrom. 174-189 [doi]
- Decidable structures between Church-style and Curry-styleKen-etsu Fujita, Aleksy Schubert. 190-205 [doi]
- Expressibility in the Lambda Calculus with MuClemens Grabmayer, Jan Rochel. 206-222 [doi]
- A Homotopical Completion Procedure with Applications to Coherence of MonoidsYves Guiraud, Philippe Malbos, Samuel Mimram. 223-238 [doi]
- Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of EmbeddingsManfred Schmidt-Schauß, Elena Machkasova, David Sabel. 239-254 [doi]
- Algorithms for Extended Alpha-Equivalence and ComplexityManfred Schmidt-Schauß, Conrad Rau, David Sabel. 255-270 [doi]
- Unification Modulo Nonnested Recursion Schemes via Anchored Semi-UnificationGert Smolka, Tobias Tebbi. 271-286 [doi]
- Formalizing Knuth-Bendix Orders and Knuth-Bendix CompletionChristian Sternagel, René Thiemann. 287-302 [doi]
- Automatic Decidability: A Schematic Calculus for Theories with Counting OperatorsElena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko. 303-318 [doi]
- Normalized Completion RevisitedSarah Winkler, Aart Middeldorp. 319-334 [doi]
- Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein SequenceSarah Winkler, Harald Zankl, Aart Middeldorp. 335-351 [doi]
- Confluence by Decreasing Diagrams - FormalizedHarald Zankl. 352-367 [doi]