HTML Export for RTA 2013

Copy to Clipboard Download

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