LIPIcs, Volume 6, RTA 2010

• Christopher Lynch LIPIcs, Volume 6, RTA'10, Complete Volume 10.4230/LIPIcs.RTA.2010
• Christopher Lynch Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List) 10.4230/LIPIcs.RTA.2010.i
• Christopher Lynch Preface 10.4230/LIPIcs.RTA.2010.XIII
• Mikolaj Bojanczyk Automata for Data Words and Data Trees 10.4230/LIPIcs.RTA.2010.1
• Vincent van Oostrom Realising Optimal Sharing 10.4230/LIPIcs.RTA.2010.5
• Takahito Aoto Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling 10.4230/LIPIcs.RTA.2010.7
• Claus Appel, Vincent van Oostrom, and Jakob Grue Simonsen Higher-Order (Non-)Modularity 10.4230/LIPIcs.RTA.2010.17
• Martin Avanzini and Georg Moser Closing the Gap Between Runtime Complexity and Polytime Computability 10.4230/LIPIcs.RTA.2010.33
• Patrick Bahr Abstract Models of Transfinite Reductions 10.4230/LIPIcs.RTA.2010.49
• Patrick Bahr Partial Order Infinitary Term Rewriting and Böhm Trees 10.4230/LIPIcs.RTA.2010.67
• Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van Oostrom Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting 10.4230/LIPIcs.RTA.2010.85
• Ken-Etsu Fujita and Aleksy Schubert The Undecidability of Type Related Problems in Type-free Style System F 10.4230/LIPIcs.RTA.2010.103
• Karl Gmeiner, Bernhard Gramlich, and Felix Schernhammer On (Un)Soundness of Unravelings 10.4230/LIPIcs.RTA.2010.119
• Alessio Guglielmi, Tom Gundersen, and Michel Parigot A Proof Calculus Which Reduces Syntactic Bureaucracy 10.4230/LIPIcs.RTA.2010.135
• Mark Hills and Grigore Rosu A Rewriting Logic Semantics Approach to Modular Program Analysis 10.4230/LIPIcs.RTA.2010.151
• Stefan Kahrs Infinitary Rewriting: Foundations Revisited 10.4230/LIPIcs.RTA.2010.161
• Alexander Koller and Stefan Thater Underspecified computation of normal forms 10.4230/LIPIcs.RTA.2010.177
• Temur Kutsia and Mircea Marin Order-Sorted Unification with Regular Expression Sorts 10.4230/LIPIcs.RTA.2010.193
• Jordi Levy and Mateu Villaret An Efficient Nominal Unification Algorithm 10.4230/LIPIcs.RTA.2010.209
• Samuel Mimram Computing Critical Pairs in 2-Dimensional Rewriting Systems 10.4230/LIPIcs.RTA.2010.227
• Friedrich Neurauter and Aart Middeldorp Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers 10.4230/LIPIcs.RTA.2010.243
• Carsten Otto, Marc Brockschmidt, Christian von Essen, and Jürgen Giesl Automated Termination Analysis of Java Bytecode by Term Rewriting 10.4230/LIPIcs.RTA.2010.259
• Adrian Riesco, Alberto Verdejo, and Narciso Marti-Oliet Declarative Debugging of Missing Answers for Maude 10.4230/LIPIcs.RTA.2010.277
• Manfred Schmidt-Schauss, David Sabel, and Elena Machkasova Simulation in the Call-by-Need Lambda-Calculus with letrec 10.4230/LIPIcs.RTA.2010.295
• Jakob Grue Simonsen Weak Convergence and Uniform Normalization in Infinitary Rewriting 10.4230/LIPIcs.RTA.2010.311
• Christian Sternagel and René Thiemann Certified Subterm Criterion and Certified Usable Rules 10.4230/LIPIcs.RTA.2010.325
• Irène Durand, Géraud Sénizergues, and Marc Sylvestre Termination of linear bounded term rewriting systems 10.4230/LIPIcs.RTA.2010.341
• Johannes Waldmann Polynomially Bounded Matrix Interpretations 10.4230/LIPIcs.RTA.2010.357
• Sarah Winkler, Haruhiko Sato, Aart Middeldorp, and Masahito Kurihara Optimizing mkbTT 10.4230/LIPIcs.RTA.2010.373
• Harald Zankl and Martin Korp Modular Complexity Analysis via Relative Complexity 10.4230/LIPIcs.RTA.2010.385
• Hans Zantema and Matthias Raffelsieper Proving Productivity in Infinite Data Structures 10.4230/LIPIcs.RTA.2010.401