Christopher Lynch
Proceedings of the 21st International Conference on Rewriting Techniques and Applications
RTA, 2010.

@proceedings{RTA-2010,
	address       = "Edinburgh, Scottland, United Kingdom",
	editor        = "Christopher Lynch",
	ee            = "http://drops.dagstuhl.de/opus/portals/extern/index.php?semnr=10002",
	isbn          = "978-3-939897-18-7",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 21st International Conference on Rewriting Techniques and Applications}",
	volume        = 6,
	year          = 2010,
}

Contents (28 items)

4 ×#term rewriting
3 ×#composition
3 ×#normalisation
3 ×#proving
2 ×#analysis
2 ×#automation
2 ×#bound
2 ×#complexity
2 ×#termination
2 ×#unification

RTA-2010-Bojanczyk #automaton #word

Automata for Data Words and Data Trees (MB), pp. 1–4.

RTA-2010-Oostrom

Realising Optimal Sharing (VvO), pp. 5–6.

RTA-2010-Aoto #automation #confluence #diagrams #proving

Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling (TA), pp. 7–16.

RTA-2010-AppelOS #composition #higher-order

Higher-Order (Non-)Modularity (CA, VvO, JGS), pp. 17–32.

RTA-2010-AvanziniM #complexity #runtime

Closing the Gap Between Runtime Complexity and Polytime Computability (MA, GM), pp. 33–48.

RTA-2010-Bahr #modelling #reduction

Abstract Models of Transfinite Reductions (PB), pp. 49–66.

RTA-2010-Bahr10a #partial order #term rewriting

Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.

RTA-2010-EndrullisGHKO #normalisation #orthogonal

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting (JE, CG, DH, JWK, VvO), pp. 85–102.

RTA-2010-FujitaS #problem #system f

The Undecidability of Type Related Problems in Type-free Style System F (KeF, AS), pp. 103–118.

RTA-2010-GmeinerGS #on the

On (Un)Soundness of Unravelings (KG, BG, FS), pp. 119–134.

RTA-2010-GuglielmiGP #calculus #proving

A Proof Calculus Which Reduces Syntactic Bureaucracy (AG, TG, MP), pp. 135–150.

RTA-2010-HillsR #approach #composition #logic #program analysis #semantics

A Rewriting Logic Semantics Approach to Modular Program Analysis (MH, GR), pp. 151–160.

RTA-2010-Kahrs #revisited

Infinitary Rewriting: Foundations Revisited (SK), pp. 161–176.

RTA-2010-KollerT #normalisation

Underspecified computation of normal forms (AK, ST), pp. 177–192.

RTA-2010-KutsiaM #order #regular expression #unification

Order-Sorted Unification with Regular Expression Sorts (TK, MM), pp. 193–208.

RTA-2010-LevyV #algorithm #performance #unification

An Efficient Nominal Unification Algorithm (JL, MV), pp. 209–226.

RTA-2010-Mimram #2d #term rewriting

Computing Critical Pairs in 2-Dimensional Rewriting Systems (SM), pp. 227–242.

RTA-2010-NeurauterM #integer #polynomial

Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers (FN, AM), pp. 243–258.

RTA-2010-OttoBEG #analysis #automation #bytecode #java #term rewriting #termination

Automated Termination Analysis of Java Bytecode by Term Rewriting (CO, MB, CvE, JG), pp. 259–276.

RTA-2010-RiescoVM #debugging #declarative #maude

Declarative Debugging of Missing Answers for Maude (AR, AV, NMO), pp. 277–294.

RTA-2010-Schmidt-SchaussSM #call-by #simulation #λ-calculus

Simulation in the Call-by-Need λ-Calculus with letrec (MSS, DS, EM), pp. 295–310.

RTA-2010-Simonsen #convergence #normalisation

Weak Convergence and Uniform Normalization in Infinitary Rewriting (JGS), pp. 311–324.

RTA-2010-SternagelT

Certified Subterm Criterion and Certified Usable Rules (CS, RT), pp. 325–340.

RTA-2010-DurandSS #bound #linear #term rewriting #termination

Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.

RTA-2010-Waldmann #bound #matrix

Polynomially Bounded Matrix Interpretations (JW), pp. 357–372.

RTA-2010-WinklerSMK #optimisation

Optimizing mkbTT (SW, HS, AM, MK), pp. 373–384.

RTA-2010-ZanklK #analysis #complexity #composition

Modular Complexity Analysis via Relative Complexity (HZ, MK), pp. 385–400.

RTA-2010-ZantemaR #data type #infinity #proving

Proving Productivity in Infinite Data Structures (HZ, MR), pp. 401–416.