16th RTA 2005: Nara, Japan
- Jürgen Giesl:
Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3467, Springer 2005, ISBN 3-540-25596-6 - Christopher Lynch, Barbara Morawska:
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. 90-104 - Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds. 150-164 - Joe Hendrix, Manuel Clavel, José Meseguer:
A Sufficient Completeness Reasoning Tool for Partial Specifications. 165-174 - Alex K. Simpson:
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. 219-234 - Ryo Yoshinaka:
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. 235-249 - Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
Partial Inversion of Constructor Term Rewriting Systems. 264-278 - Santiago Escobar, José Meseguer, Prasanna Thati:
Natural Narrowing for General Term Rewriting Systems. 279-293 - Hubert Comon-Lundh, Stéphanie Delaune:
The Finite Variant Property: How to Get Rid of Some Algebraic Properties. 294-307 - Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Intruder Deduction for AC-Like Equational Theories with Homomorphisms. 308-322 - Wojciech Moczydlowski, Alfons Geser:
Termination of Single-Threaded One-Rule Semi-Thue Systems. 338-352 - Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. 353-367 - Amy P. Felty:
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code. 394-406