RTA 2010 July 11-13, 2010, Edinburgh, Scottland, UK

Proceedings of the 21st International Conference on Rewriting Techniques and Applications



Christopher Lynch (Ed.)
ISBN 978-3-939897-18-7 ISSN 1868-8969
Additional Information
License
Conference Website
Complete volume (PDF, 3 MB)
Search Publication Server

Authors
  • Aoto, Takahito
  • Appel, Claus
  • Avanzini, Martin
  • Bahr, Patrick
  • Bojanczyk, Mikolaj
  • Brockschmidt, Marc
  • Durand, Irène
  • Endrullis, Joerg
  • Fujita, Ken-Etsu
  • Giesl, Jürgen
  • Gmeiner, Karl
  • Grabmayer, Clemens
  • Gramlich, Bernhard
  • Guglielmi, Alessio
  • Gundersen, Tom
  • Hendriks, Dimitri
  • Hills, Mark
  • Kahrs, Stefan
  • Klop, Jan Willem
  • Koller, Alexander
  • Korp, Martin
  • Kurihara, Masahito
  • Kutsia, Temur
  • Levy, Jordi
  • Lynch, Christopher
  • Machkasova, Elena
  • Marin, Mircea
  • Marti-Oliet, Narciso
  • Middeldorp, Aart
  • Mimram, Samuel
  • Moser, Georg
  • Neurauter, Friedrich
  • Otto, Carsten
  • Parigot, Michel
  • Raffelsieper, Matthias
  • Riesco, Adrian
  • Rosu, Grigore
  • Sabel, David
  • Sato, Haruhiko
  • Schernhammer, Felix
  • Schmidt-Schauss, Manfred
  • Schubert, Aleksy
  • Simonsen, Jakob Grue
  • Sternagel, Christian
  • Sylvestre, Marc
  • Sénizergues, Géraud
  • Thater, Stefan
  • Thiemann, René
  • Verdejo, Alberto
  • Villaret, Mateu
  • Waldmann, Johannes
  • Winkler, Sarah
  • Zankl, Harald
  • Zantema, Hans
  • van Oostrom, Vincent
  • von Essen, Christian
    		•

    		  
    Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List)
    Authors: Lynch, Christopher

    Abstract | Document (301 KB) | BibTeX

    Preface
    Authors: Lynch, Christopher

    Abstract | Document (100 KB) | BibTeX

    Automata for Data Words and Data Trees
    Authors: Bojanczyk, Mikolaj

    Abstract | Document (70 KB) | BibTeX

    Realising Optimal Sharing
    Authors: van Oostrom, Vincent

    Abstract | Document (35 KB) | BibTeX

    Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
    Authors: Aoto, Takahito

    Abstract | Document (149 KB) | BibTeX

    Higher-Order (Non-)Modularity
    Authors: Appel, Claus ; van Oostrom, Vincent ; Simonsen, Jakob Grue

    Abstract | Document (173 KB) | BibTeX

    Closing the Gap Between Runtime Complexity and Polytime Computability
    Authors: Avanzini, Martin ; Moser, Georg

    Abstract | Document (207 KB) | BibTeX

    Abstract Models of Transfinite Reductions
    Authors: Bahr, Patrick

    Abstract | Document (203 KB) | BibTeX

    Partial Order Infinitary Term Rewriting and Böhm Trees
    Authors: Bahr, Patrick

    Abstract | Document (206 KB) | BibTeX

    Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
    Authors: Endrullis, Joerg ; Grabmayer, Clemens ; Hendriks, Dimitri ; Klop, Jan Willem ; van Oostrom, Vincent

    Abstract | Document (235 KB) | BibTeX

    The Undecidability of Type Related Problems in Type-free Style System F
    Authors: Fujita, Ken-Etsu ; Schubert, Aleksy

    Abstract | Document (184 KB) | BibTeX

    On (Un)Soundness of Unravelings
    Authors: Gmeiner, Karl ; Gramlich, Bernhard ; Schernhammer, Felix

    Abstract | Document (185 KB) | BibTeX

    A Proof Calculus Which Reduces Syntactic Bureaucracy
    Authors: Guglielmi, Alessio ; Gundersen, Tom ; Parigot, Michel

    Abstract | Document (175 KB) | BibTeX

    A Rewriting Logic Semantics Approach to Modular Program Analysis
    Authors: Hills, Mark ; Rosu, Grigore

    Abstract | Document (135 KB) | BibTeX

    Infinitary Rewriting: Foundations Revisited
    Authors: Kahrs, Stefan

    Abstract | Document (166 KB) | BibTeX

    Underspecified computation of normal forms
    Authors: Koller, Alexander ; Thater, Stefan

    Abstract | Document (190 KB) | BibTeX

    Order-Sorted Unification with Regular Expression Sorts
    Authors: Kutsia, Temur ; Marin, Mircea

    Abstract | Document (185 KB) | BibTeX

    An Efficient Nominal Unification Algorithm
    Authors: Levy, Jordi ; Villaret, Mateu

    Abstract | Document (193 KB) | BibTeX

    Computing Critical Pairs in 2-Dimensional Rewriting Systems
    Authors: Mimram, Samuel

    Abstract | Document (244 KB) | BibTeX

    Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
    Authors: Neurauter, Friedrich ; Middeldorp, Aart

    Abstract | Document (161 KB) | BibTeX

    Automated Termination Analysis of Java Bytecode by Term Rewriting
    Authors: Otto, Carsten ; Brockschmidt, Marc ; von Essen, Christian ; Giesl, Jürgen

    Abstract | Document (227 KB) | BibTeX

    Declarative Debugging of Missing Answers for Maude
    Authors: Riesco, Adrian ; Verdejo, Alberto ; Marti-Oliet, Narciso

    Abstract | Document (207 KB) | BibTeX

    Simulation in the Call-by-Need Lambda-Calculus with letrec
    Authors: Schmidt-Schauss, Manfred ; Sabel, David ; Machkasova, Elena

    Abstract | Document (182 KB) | BibTeX

    Weak Convergence and Uniform Normalization in Infinitary Rewriting
    Authors: Simonsen, Jakob Grue

    Abstract | Document (161 KB) | BibTeX

    Certified Subterm Criterion and Certified Usable Rules
    Authors: Sternagel, Christian ; Thiemann, René

    Abstract | Document (199 KB) | BibTeX

    Termination of linear bounded term rewriting systems
    Authors: Durand, Irène ; Sénizergues, Géraud ; Sylvestre, Marc

    Abstract | Document (197 KB) | BibTeX

    Polynomially Bounded Matrix Interpretations
    Authors: Waldmann, Johannes

    Abstract | Document (200 KB) | BibTeX

    Optimizing mkbTT
    Authors: Winkler, Sarah ; Sato, Haruhiko ; Middeldorp, Aart ; Kurihara, Masahito

    Abstract | Document (197 KB) | BibTeX

    Modular Complexity Analysis via Relative Complexity
    Authors: Zankl, Harald ; Korp, Martin

    Abstract | Document (183 KB) | BibTeX

    Proving Productivity in Infinite Data Structures
    Authors: Zantema, Hans ; Raffelsieper, Matthias

    Abstract | Document (219 KB) | BibTeX

    		  



    DROPS-Home | Fulltext Search | Imprint Published by LZI