Term Rewriting and Applications: 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005),whichwasheldonApril19– 21, 2005, at the Nara-Ken New Public Hall in the center of the Nara National Park in Nara, Japan. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), and Aachen (2004). This year, there were 79 submissions from 20 countries, of which 31 papers were accepted for publication (29 regular papers and 2 system descriptions). The submissions came from France (10 accepted papers of the 23.1 submitted papers), USA (5.6 of 11.7), Japan (4 of 9), Spain (2.7 of 6.5), UK (2.7 of 4.7), The Netherlands (1.7 of 3.8), Germany (1.3 of 2.3), Austria (1 of 1), Poland (1 of 1), Israel (0.5 of 0.8), Denmark (0.5 of 0.5), China (0 of 4), Korea (0 of 4), Taiwan (0 of 1.3), Australia (0 of 1), Brazil (0 of 1), Russia (0 of 1), Switzerland (0 of 1), Sweden (0 of 1), and Italy (0 of 0.3). Each submission was assigned to at least three Program Committee m- bers, who carefully reviewed the papers, with the help of 111 external referees.

Author(s): Yoshihito Toyama (auth.), Jürgen Giesl (eds.)
Series: Lecture Notes in Computer Science 3467 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Commentary: Correct bookmarks, cover, pagination
Pages: 517
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Symbolic and Algebraic Manipulation

Front Matter....Pages -
Confluent Term Rewriting Systems....Pages 1-1
Generalized Innermost Rewriting....Pages 2-16
Orderings for Innermost Termination....Pages 17-31
Leanest Quasi-orderings....Pages 32-45
Abstract Modularity....Pages 46-60
Union of Equational Theories: An Algebraic Approach....Pages 61-73
Equivariant Unification....Pages 74-89
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories....Pages 90-104
Unification in a Class of Permutative Theories....Pages 105-119
Dependency Pairs for Simply Typed Term Rewriting....Pages 120-134
Universal Algebra for Termination of Higher-Order Rewriting....Pages 135-149
Quasi-interpretations and Small Space Bounds....Pages 150-164
A Sufficient Completeness Reasoning Tool for Partial Specifications....Pages 165-174
Tyrolean Termination Tool....Pages 175-184
Call-by-Value Is Dual to Call-by-Name – Reloaded....Pages 185-203
λμ -Calculus and Duality: Call-by-Name and Call-by-Value....Pages 204-218
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics....Pages 219-234
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete....Pages 235-249
Localized Fairness: A Rewriting Semantics....Pages 250-263
Partial Inversion of Constructor Term Rewriting Systems....Pages 264-278
Natural Narrowing for General Term Rewriting Systems....Pages 279-293
The Finite Variant Property: How to Get Rid of Some Algebraic Properties....Pages 294-307
Intruder Deduction for AC -Like Equational Theories with Homomorphisms....Pages 308-322
Proving Positive Almost-Sure Termination....Pages 323-337
Termination of Single-Threaded One-Rule Semi-Thue Systems....Pages 338-352
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems....Pages 353-367
Twenty Years Later....Pages 368-375
Open. Closed. Open.....Pages 376-393
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code....Pages 394-406
Extending the Explicit Substitution Paradigm....Pages 407-422
Arithmetic as a Theory Modulo....Pages 423-437
Infinitary Combinatory Reduction Systems....Pages 438-452
Proof-Producing Congruence Closure....Pages 453-468
The Algebra of Equality Proofs....Pages 469-483
On Computing Reachability Sets of Process Rewrite Systems....Pages 484-499
Automata and Logics for Unranked and Unordered Trees....Pages 500-515
Back Matter....Pages -