<h2>LIPIcs, Volume 15, RTA 2012</h2>
<ul>
<li>
<span class="authors">Ashish Tiwari</span>
<span class="title">LIPIcs, Volume 15, RTA'12, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012">10.4230/LIPIcs.RTA.2012</a>
</li>
<li>
<span class="authors">Ashish Tiwari</span>
<span class="title">RTA 2012 Proceedings Frontmatter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.i">10.4230/LIPIcs.RTA.2012.i</a>
</li>
<li>
<span class="authors">Hirokazu Anai</span>
<span class="title">Computational Real Algebraic Geometry in Practice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.1">10.4230/LIPIcs.RTA.2012.1</a>
</li>
<li>
<span class="authors">Claude Kirchner</span>
<span class="title">Rho-Calculi for Computation and Logic (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.2">10.4230/LIPIcs.RTA.2012.2</a>
</li>
<li>
<span class="authors">Sebastian Maneth</span>
<span class="title">Dictionary-Based Tree Compression (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.5">10.4230/LIPIcs.RTA.2012.5</a>
</li>
<li>
<span class="authors">Beniamino Accattoli</span>
<span class="title">An Abstract Factorization Theorem for Explicit Substitutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.6">10.4230/LIPIcs.RTA.2012.6</a>
</li>
<li>
<span class="authors">Beniamino Accattoli and Ugo Dal Lago</span>
<span class="title">On the Invariance of the Unitary Cost Model for Head Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.22">10.4230/LIPIcs.RTA.2012.22</a>
</li>
<li>
<span class="authors">Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, and Volker Sorge</span>
<span class="title">A Term Rewriting System for Kuratowski's Closure-Complement Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.38">10.4230/LIPIcs.RTA.2012.38</a>
</li>
<li>
<span class="authors">Soren Bjerg Andersen and Jakob Grue Simonsen</span>
<span class="title">Term Rewriting Systems as Topological Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.53">10.4230/LIPIcs.RTA.2012.53</a>
</li>
<li>
<span class="authors">Patrick Bahr</span>
<span class="title">Infinitary Term Graph Rewriting is Simple, Sound and Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.69">10.4230/LIPIcs.RTA.2012.69</a>
</li>
<li>
<span class="authors">Thibaut Balabonski</span>
<span class="title">Axiomatic Sharing-via-Labelling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.85">10.4230/LIPIcs.RTA.2012.85</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, and Jan Stückrath</span>
<span class="title">On the Decidability Status of Reachability and Coverability in Graph Transformation Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.101">10.4230/LIPIcs.RTA.2012.101</a>
</li>
<li>
<span class="authors">Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro Rios</span>
<span class="title">Normalisation for Dynamic Pattern Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.117">10.4230/LIPIcs.RTA.2012.117</a>
</li>
<li>
<span class="authors">Denis Cousineau and Olivier Hermant</span>
<span class="title">A Semantic Proof that Reducibility Candidates entail Cut Elimination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.133">10.4230/LIPIcs.RTA.2012.133</a>
</li>
<li>
<span class="authors">Carles Creus, Adria Gascon, and Guillem Godoy</span>
<span class="title">One-context Unification with STG-Compressed Terms is in NP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.149">10.4230/LIPIcs.RTA.2012.149</a>
</li>
<li>
<span class="authors">Bertram Felgenhauer</span>
<span class="title">Deciding Confluence of Ground Term Rewrite Systems in Cubic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.165">10.4230/LIPIcs.RTA.2012.165</a>
</li>
<li>
<span class="authors">Carsten Fuhs and Cynthia Kop</span>
<span class="title">Polynomial Interpretations for Higher-Order Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.176">10.4230/LIPIcs.RTA.2012.176</a>
</li>
<li>
<span class="authors">Karl Gmeiner, Bernhard Gramlich, and Felix Schernhammer</span>
<span class="title">On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.193">10.4230/LIPIcs.RTA.2012.193</a>
</li>
<li>
<span class="authors">Jeroen Ketema</span>
<span class="title">Reinterpreting Compression in Infinitary Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.209">10.4230/LIPIcs.RTA.2012.209</a>
</li>
<li>
<span class="authors">Alexei Lisitsa</span>
<span class="title">Finite Models vs Tree Automata in Safety Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.225">10.4230/LIPIcs.RTA.2012.225</a>
</li>
<li>
<span class="authors">Vincent van Oostrom and Hans Zantema</span>
<span class="title">Triangulation in Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.240">10.4230/LIPIcs.RTA.2012.240</a>
</li>
<li>
<span class="authors">Christian Sattler and Florent Balestrieri</span>
<span class="title">Turing-Completeness of Polymorphic Stream Equation Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.256">10.4230/LIPIcs.RTA.2012.256</a>
</li>
<li>
<span class="authors">Manfred Schmidt-Schauß</span>
<span class="title">Matching of Compressed Patterns with Character-Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.272">10.4230/LIPIcs.RTA.2012.272</a>
</li>
<li>
<span class="authors">Paula Severi and Fer-Jan de Vries</span>
<span class="title">Meaningless Sets in Infinitary Combinatory Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.288">10.4230/LIPIcs.RTA.2012.288</a>
</li>
<li>
<span class="authors">Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn Talcott, and Ranko Perovic</span>
<span class="title">A Rewriting Framework for Activities Subject to Regulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.305">10.4230/LIPIcs.RTA.2012.305</a>
</li>
<li>
<span class="authors">Kazushige Terui</span>
<span class="title">Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.323">10.4230/LIPIcs.RTA.2012.323</a>
</li>
<li>
<span class="authors">René Thiemann, Guillaume Allais, and Julian Nagele</span>
<span class="title">On the Formalization of Termination Techniques based on Multiset Orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2012.339">10.4230/LIPIcs.RTA.2012.339</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