LIPIcs, Volume 21, RTA 2013

• Femke van Raamsdonk LIPIcs, Volume 21, RTA'13, Complete Volume 10.4230/LIPIcs.RTA.2013
• Femke van Raamsdonk Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.RTA.2013.i
• Jarkko Kari Pattern Generation by Cellular Automata (Invited Talk) 10.4230/LIPIcs.RTA.2013.1
• Mitsuhiro Okada Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk) 10.4230/LIPIcs.RTA.2013.4
• Dimitrios Vytiniotis and Simon Peyton Jones Evidence Normalization in System FC (Invited Talk) 10.4230/LIPIcs.RTA.2013.20
• Beniamino Accattoli Linear Logic and Strong Normalization 10.4230/LIPIcs.RTA.2013.39
• Martin Avanzini and Georg Moser A Combination Framework for Complexity 10.4230/LIPIcs.RTA.2013.55
• Martin Avanzini and Georg Moser Tyrolean Complexity Tool: Features and Usage 10.4230/LIPIcs.RTA.2013.71
• Kyungmin Bae, Santiago Escobar, and José Meseguer Abstract Logical Model Checking of Infinite-State Systems Using Narrowing 10.4230/LIPIcs.RTA.2013.81
• Alexander Bau, Markus Lohrey, Eric Nöth, and Johannes Waldmann Compression of Rewriting Systems for Termination Analysis 10.4230/LIPIcs.RTA.2013.97
• Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret A Variant of Higher-Order Anti-Unification 10.4230/LIPIcs.RTA.2013.113
• Yohan Boichut, Jacques Chabin, and Pierre Réty Over-approximating Descendants by Synchronized Tree Languages 10.4230/LIPIcs.RTA.2013.128
• Christophe Calvès Unifying Nominal Unification 10.4230/LIPIcs.RTA.2013.143
• Anupam Das Rewriting with Linear Inferences in Propositional Logic 10.4230/LIPIcs.RTA.2013.158
• Bertram Felgenhauer and Vincent van Oostrom Proof Orders for Decreasing Diagrams 10.4230/LIPIcs.RTA.2013.174
• Ken-etsu Fujita and Aleksy Schubert Decidable structures between Church-style and Curry-style 10.4230/LIPIcs.RTA.2013.190
• Clemens Grabmayer and Jan Rochel Expressibility in the Lambda Calculus with Mu 10.4230/LIPIcs.RTA.2013.206
• Yves Guiraud, Philippe Malbos, and Samuel Mimram A Homotopical Completion Procedure with Applications to Coherence of Monoids 10.4230/LIPIcs.RTA.2013.223
• Manfred Schmidt-Schauß, Elena Machkasova, and David Sabel Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings 10.4230/LIPIcs.RTA.2013.239
• Manfred Schmidt-Schauß, Conrad Rau, and David Sabel Algorithms for Extended Alpha-Equivalence and Complexity 10.4230/LIPIcs.RTA.2013.255
• Gert Smolka and Tobias Tebbi Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification 10.4230/LIPIcs.RTA.2013.271
• Christian Sternagel and René Thiemann Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion 10.4230/LIPIcs.RTA.2013.287
• Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, and Olga Kouchnarenko Automatic Decidability: A Schematic Calculus for Theories with Counting Operators 10.4230/LIPIcs.RTA.2013.303
• Sarah Winkler and Aart Middeldorp Normalized Completion Revisited 10.4230/LIPIcs.RTA.2013.319
• Sarah Winkler, Harald Zankl, and Aart Middeldorp Beyond Peano Arithmetic – Automatically Proving Termination of the Goodstein Sequence 10.4230/LIPIcs.RTA.2013.335
• Harald Zankl Confluence by Decreasing Diagrams – Formalized 10.4230/LIPIcs.RTA.2013.352