<h2>LIPIcs, Volume 6, RTA 2010</h2>
<ul>
<li>
<span class="authors">Christopher Lynch</span>
<span class="title">LIPIcs, Volume 6, RTA'10, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010">10.4230/LIPIcs.RTA.2010</a>
</li>
<li>
<span class="authors">Christopher Lynch</span>
<span class="title">Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.i">10.4230/LIPIcs.RTA.2010.i</a>
</li>
<li>
<span class="authors">Christopher Lynch</span>
<span class="title">Preface</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.XIII">10.4230/LIPIcs.RTA.2010.XIII</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Automata for Data Words and Data Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.1">10.4230/LIPIcs.RTA.2010.1</a>
</li>
<li>
<span class="authors">Vincent van Oostrom</span>
<span class="title">Realising Optimal Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.5">10.4230/LIPIcs.RTA.2010.5</a>
</li>
<li>
<span class="authors">Takahito Aoto</span>
<span class="title">Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.7">10.4230/LIPIcs.RTA.2010.7</a>
</li>
<li>
<span class="authors">Claus Appel, Vincent van Oostrom, and Jakob Grue Simonsen</span>
<span class="title">Higher-Order (Non-)Modularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.17">10.4230/LIPIcs.RTA.2010.17</a>
</li>
<li>
<span class="authors">Martin Avanzini and Georg Moser</span>
<span class="title">Closing the Gap Between Runtime Complexity and Polytime Computability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.33">10.4230/LIPIcs.RTA.2010.33</a>
</li>
<li>
<span class="authors">Patrick Bahr</span>
<span class="title">Abstract Models of Transfinite Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.49">10.4230/LIPIcs.RTA.2010.49</a>
</li>
<li>
<span class="authors">Patrick Bahr</span>
<span class="title">Partial Order Infinitary Term Rewriting and Böhm Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.67">10.4230/LIPIcs.RTA.2010.67</a>
</li>
<li>
<span class="authors">Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van Oostrom</span>
<span class="title">Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.85">10.4230/LIPIcs.RTA.2010.85</a>
</li>
<li>
<span class="authors">Ken-Etsu Fujita and Aleksy Schubert</span>
<span class="title">The Undecidability of Type Related Problems in Type-free Style System F</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.103">10.4230/LIPIcs.RTA.2010.103</a>
</li>
<li>
<span class="authors">Karl Gmeiner, Bernhard Gramlich, and Felix Schernhammer</span>
<span class="title">On (Un)Soundness of Unravelings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.119">10.4230/LIPIcs.RTA.2010.119</a>
</li>
<li>
<span class="authors">Alessio Guglielmi, Tom Gundersen, and Michel Parigot</span>
<span class="title">A Proof Calculus Which Reduces Syntactic Bureaucracy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.135">10.4230/LIPIcs.RTA.2010.135</a>
</li>
<li>
<span class="authors">Mark Hills and Grigore Rosu</span>
<span class="title">A Rewriting Logic Semantics Approach to Modular Program Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.151">10.4230/LIPIcs.RTA.2010.151</a>
</li>
<li>
<span class="authors">Stefan Kahrs</span>
<span class="title">Infinitary Rewriting: Foundations Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.161">10.4230/LIPIcs.RTA.2010.161</a>
</li>
<li>
<span class="authors">Alexander Koller and Stefan Thater</span>
<span class="title">Underspecified computation of normal forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.177">10.4230/LIPIcs.RTA.2010.177</a>
</li>
<li>
<span class="authors">Temur Kutsia and Mircea Marin</span>
<span class="title">Order-Sorted Unification with Regular Expression Sorts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.193">10.4230/LIPIcs.RTA.2010.193</a>
</li>
<li>
<span class="authors">Jordi Levy and Mateu Villaret</span>
<span class="title">An Efficient Nominal Unification Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.209">10.4230/LIPIcs.RTA.2010.209</a>
</li>
<li>
<span class="authors">Samuel Mimram</span>
<span class="title">Computing Critical Pairs in 2-Dimensional Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.227">10.4230/LIPIcs.RTA.2010.227</a>
</li>
<li>
<span class="authors">Friedrich Neurauter and Aart Middeldorp</span>
<span class="title">Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.243">10.4230/LIPIcs.RTA.2010.243</a>
</li>
<li>
<span class="authors">Carsten Otto, Marc Brockschmidt, Christian von Essen, and Jürgen Giesl</span>
<span class="title">Automated Termination Analysis of Java Bytecode by Term Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.259">10.4230/LIPIcs.RTA.2010.259</a>
</li>
<li>
<span class="authors">Adrian Riesco, Alberto Verdejo, and Narciso Marti-Oliet</span>
<span class="title">Declarative Debugging of Missing Answers for Maude</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.277">10.4230/LIPIcs.RTA.2010.277</a>
</li>
<li>
<span class="authors">Manfred Schmidt-Schauss, David Sabel, and Elena Machkasova</span>
<span class="title">Simulation in the Call-by-Need Lambda-Calculus with letrec</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.295">10.4230/LIPIcs.RTA.2010.295</a>
</li>
<li>
<span class="authors">Jakob Grue Simonsen</span>
<span class="title">Weak Convergence and Uniform Normalization in Infinitary Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.311">10.4230/LIPIcs.RTA.2010.311</a>
</li>
<li>
<span class="authors">Christian Sternagel and René Thiemann</span>
<span class="title">Certified Subterm Criterion and Certified Usable Rules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.325">10.4230/LIPIcs.RTA.2010.325</a>
</li>
<li>
<span class="authors">Irène Durand, Géraud Sénizergues, and Marc Sylvestre</span>
<span class="title">Termination of linear bounded term rewriting systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.341">10.4230/LIPIcs.RTA.2010.341</a>
</li>
<li>
<span class="authors">Johannes Waldmann</span>
<span class="title">Polynomially Bounded Matrix Interpretations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.357">10.4230/LIPIcs.RTA.2010.357</a>
</li>
<li>
<span class="authors">Sarah Winkler, Haruhiko Sato, Aart Middeldorp, and Masahito Kurihara</span>
<span class="title">Optimizing mkbTT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.373">10.4230/LIPIcs.RTA.2010.373</a>
</li>
<li>
<span class="authors">Harald Zankl and Martin Korp</span>
<span class="title">Modular Complexity Analysis via Relative Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.385">10.4230/LIPIcs.RTA.2010.385</a>
</li>
<li>
<span class="authors">Hans Zantema and Matthias Raffelsieper</span>
<span class="title">Proving Productivity in Infinite Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2010.401">10.4230/LIPIcs.RTA.2010.401</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing