Andrei Voronkov
Proceedings of the 19th International Conference on Rewriting Techniques and Applications
RTA, 2008.

@proceedings{RTA-2008,
	address       = "Hagenberg, Austria",
	editor        = "Andrei Voronkov",
	isbn          = "978-3-540-70588-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 19th International Conference on Rewriting Techniques and Applications}",
	volume        = 5117,
	year          = 2008,
}

Contents (30 items)

4 ×#termination
3 ×#automaton
3 ×#proving
3 ×#term rewriting
3 ×#λ-calculus
2 ×#combinator
2 ×#confluence
2 ×#diagrams
2 ×#encoding
2 ×#finite

RTA-2008-AlpuenteEI #composition #termination

Modular Termination of Basic Narrowing (MA, SE, JI), pp. 1–16.

RTA-2008-ArrighiD #algebra #confluence #encoding #higher-order #λ-calculus

Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.

RTA-2008-BallandM #graph grammar

Term-Graph Rewriting Via Explicit Paths (EB, PEM), pp. 32–47.

RTA-2008-BoichutCHK #abstraction #approximate #refinement

Finer Is Better: Abstraction Refinement for Rewriting Approximations (YB, RC, PCH, OK), pp. 48–62.

RTA-2008-EchahedP #pointer

A Needed Rewriting Strategy for Data-Structures with Pointers (RE, NP), pp. 63–78.

RTA-2008-EscobarMS #effectiveness #finite

Effectively Checking the Finite Variant Property (SE, JM, RS), pp. 79–93.

RTA-2008-FalkeK #data type #dependence #semantics

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (SF, DK), pp. 94–109.

RTA-2008-FuhsGMSTZ #termination

Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.

RTA-2008-GutierrezLU #term rewriting

Usable Rules for Context-Sensitive Rewrite Systems (RG, SL, XU), pp. 126–141.

RTA-2008-HendrixO #automaton #equation

Combining Equational Tree Automata over AC and ACI Theories (JH, HO), pp. 142–156.

RTA-2008-JacquemardR

Closure of Hedge-Automata Languages by Hedge Rewriting (FJ, MR), pp. 157–171.

RTA-2008-Ketema #combinator #normalisation #on the #reduction

On Normalisation of Infinitary Combinatory Reduction Systems (JK), pp. 172–186.

RTA-2008-KojimaS #decidability #linear #reachability #term rewriting

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.

RTA-2008-KoprowskiW #termination

Arctic Termination ...Below Zero (AK, JW), pp. 202–216.

RTA-2008-KuhlmannN #automaton #logic #order

Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.

RTA-2008-LafontR #case study #diagrams #matrix #orthogonal

Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks (YL, PR), pp. 232–245.

RTA-2008-LevyV #higher-order #perspective #unification

Nominal Unification from a Higher-Order Perspective (JL, MV), pp. 246–260.

RTA-2008-MazanekM #combinator #functional #graph #parsing

Functional-Logic Graph Parser Combinators (SM, MM), pp. 261–275.

RTA-2008-MoserS #polynomial #proving #using

Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (GM, AS), pp. 276–290.

RTA-2008-KobayashiO #automaton

Tree Automata for Non-linear Arithmetic (NK, HO), pp. 291–305.

RTA-2008-Oostrom #confluence #diagrams

Confluence by Decreasing Diagrams (VvO), pp. 306–320.

RTA-2008-Schmidt-SchaussM #call-by #finite #nondeterminism #simulation #λ-calculus

A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.

RTA-2008-SternagelM

Root-Labeling (CS, AM), pp. 336–350.

RTA-2008-Stratulat #induction

Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (SS), pp. 351–365.

RTA-2008-ThiemannGS

Deciding Innermost Loops (RT, JG, PSK), pp. 366–380.

RTA-2008-Toyama #lisp #proving #recursion #term rewriting #termination

Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.

RTA-2008-Ueda #encoding #graph grammar #λ-calculus

Encoding the Pure λ Calculus into Hierarchical Graph Rewriting (KU), pp. 392–408.

RTA-2008-UrbanZ #proving

Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof (CU, BZ), pp. 409–424.

RTA-2008-EndrullisV #reduction

Reduction Under Substitution (JE, RCdV), pp. 425–440.

RTA-2008-Zantema #infinity #normalisation

Normalization of Infinite Terms (HZ), pp. 441–455.