Rewriting Techniques and Applications: 19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008, Proceedings

ISBN-13: 9783540705888 / Angielski / Miękka / 2008 / 457 str.

Andrei Voronkov

Opis

ThisvolumecontainsthepaperspresentedatRTA2008:19thInternationalC- ference on Rewriting Techniques and Applications held July 15-17th in Hag- berg, AustriaandorganisedbytheResearchInstituteonSymbolicComputation. There were 57 submissions. Each submission was reviewed by at least four Programme Committee members. The committee decided to accept 30 papers. The submission and Programme Committee work was organised through the EasyChair system. I thank the Programme Committee members for their very e?cient work. My special thanks to Temur Kutsia, Aart Middeldorp, Robert Nieuwenhuis and Maribel Fernandez for their help and advice on many aspects of the RTA - ganisation and traditions. I would also like to thank RTA General Chair Bruno Buchberger. April 2008 Andrei Voronkov Conference Organisation General Chair Bruno Buchberger (Johannes Kepler University Linz) Programme Chair Andrei Voronkov (University of Manchester) Organising Committee Chair Temur Kutsia (Johannes Kepler University Linz) Programme Committee Maribel Fern andez (King's College London) Neil Ghani (University of Nottingham) J] urgen Giesl (RWTH Aachen) Guillem Godoy (Universidad Polit ecnica de Cataluna ) Jean Goubault-Larrecq (ENS Cachan) Tetsuo Ida (University of Tsukuba) Claude Kirchner (INRIA) Konstantin Korovin (University of Manchester) Temur Kutsia (Johannes Kepler University Linz) Aart Middeldorp (University of Innsbruck) Paliath Narendran (University at Albany - SUNY) Robert Nieuwenhuis (Universidad Polit ecnica de Cataluna ) Micha] el Rusinowitch (LORIA-INRIA) Aaron Stump (Washington University in St.

Spis treści

Modular Termination of Basic Narrowing.- Linear-algebraic ?-calculus: higher-order, encodings, and confluence..- Term-Graph Rewriting Via Explicit Paths.- Finer Is Better: Abstraction Refinement for Rewriting Approximations.- A Needed Rewriting Strategy for Data-Structures with Pointers.- Effectively Checking the Finite Variant Property.- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures.- Maximal Termination.- Usable Rules for Context-Sensitive Rewrite Systems.- Combining Equational Tree Automata over AC and ACI Theories.- Closure of Hedge-Automata Languages by Hedge Rewriting.- On Normalisation of Infinitary Combinatory Reduction Systems.- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.- Arctic Termination ...Below Zero.- Logics and Automata for Totally Ordered Trees.- Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks.- Nominal Unification from a Higher-Order Perspective.- Functional-Logic Graph Parser Combinators.- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.- Tree Automata for Non-linear Arithmetic.- Confluence by Decreasing Diagrams.- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.- Root-Labeling.- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities.- Deciding Innermost Loops.- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting.- Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof.- Reduction Under Substitution.- Normalization of Infinite Terms.

Blurb

This book constitutes the refereed proceedings of the 19th International Conference on Rewriting Techniques and Applications, RTA 2008, held in Hagenberg, Austria, July 15-17, in June 2008 as part of the RISC Summer 2008.

The 30 revised full papers presented were carefully reviewed and selected from 57 initial submissions. The papers cover current research on all aspects of rewriting including typical areas of interest such as applications, foundational issues, frameworks, implementations, and semantics.