RTA 2012 - 23rd International Conference on Rewriting Techniques and Applications
Monday, May 28, 2012 to Saturday, June 2, 2012
Nagoya, Japan
Accepted Papers
Matching of Compressed Patterns with Character-Variables
Normalisation for Dynamic Pattern Calculi
Infinitary Term Graph Rewriting is Simple, Sound and Complete
One-context Unification with STG-Compressed Terms is in NP
Axiomatic Sharing-via-Labelling
Triangulation in rewriting
On the Invariance of Derivational Complexity for Head Reduction
A Rewriting Framework for Activities Subject to Regulations
Polynomial Interpretations for Higher-Order Rewriting
Semantic evaluation, intersection types and the complexity of simply typed lambda calculus
Finite models vs tree automata in safety verification
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
On the formalization of termination techniques based on multiset orderings
Term Rewriting Systems as Topological Dynamical Systems
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
Turing-Completeness of Polymorphic Stream Equation Systems
Reinterpreting Compression in Infinitary Rewriting
An abstract factorization theorem for explicit substitutions calculi
A semantic proof that reducibility candidates entail cut elimination
Meaninglessness for Combinatory Logic
A Term Rewriting System for Kuratowski's Closure-Complement Problem
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time