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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Giesl, Jürgen (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3467
• Θέματα: Computer science.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Artificial intelligence.; Computer Science.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Programming Languages, Compilers, Interpreters.; Artificial Intelligence (incl. Robotics).; Symbolic and Algebraic Manipulation.

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 researc...

Πίνακας περιεχομένων:

• Confluent Term Rewriting Systems
• Generalized Innermost Rewriting
• Orderings for Innermost Termination
• Leanest Quasi-orderings
• Abstract Modularity
• Union of Equational Theories: An Algebraic Approach
• Equivariant Unification
• Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories
• Unification in a Class of Permutative Theories
• Dependency Pairs for Simply Typed Term Rewriting
• Universal Algebra for Termination of Higher-Order Rewriting
• Quasi-interpretations and Small Space Bounds
• A Sufficient Completeness Reasoning Tool for Partial Specifications
• Tyrolean Termination Tool
• Call-by-Value Is Dual to Call-by-Name – Reloaded
• ??-Calculus and Duality: Call-by-Name and Call-by-Value
• Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics
• Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete
• Localized Fairness: A Rewriting Semantics
• Partial Inversion of Constructor Term Rewriting Systems
• Natural Narrowing for General Term Rewriting Systems
• The Finite Variant Property: How to Get Rid of Some Algebraic Properties
• Intruder Deduction for AC-Like Equational Theories with Homomorphisms
• Proving Positive Almost-Sure Termination
• Termination of Single-Threaded One-Rule Semi-Thue Systems
• On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
• Twenty Years Later
• Open. Closed. Open.
• A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
• Extending the Explicit Substitution Paradigm
• Arithmetic as a Theory Modulo
• Infinitary Combinatory Reduction Systems
• Proof-Producing Congruence Closure
• The Algebra of Equality Proofs
• On Computing Reachability Sets of Process Rewrite Systems
• Automata and Logics for Unranked and Unordered Trees.