16. RTA 2005: Nara, Japan

• Yoshihito Toyama:
  Confluent Term Rewriting Systems. 1
  
• Jaco van de Pol, Hans Zantema:
  Generalized Innermost Rewriting. 2-16
  
• Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
  Orderings for Innermost Termination. 17-31
  
• Nachum Dershowitz, E. Castedo Ellerman:
  Leanest Quasi-orderings. 32-45
  
• Michael Abbott, Neil Ghani, Christoph Lüth:
  Abstract Modularity. 46-60
  
• Piotr Hoffman:
  Union of Equational Theories: An Algebraic Approach. 61-73
  
• James Cheney:
  Equivariant Unification. 74-89
  
• Christopher Lynch, Barbara Morawska:
  Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. 90-104
  
• Thierry Boy de la Tour, Mnacho Echenim:
  Unification in a Class of Permutative Theories. 105-119
  
• Takahito Aoto, Toshiyuki Yamada:
  Dependency Pairs for Simply Typed Term Rewriting. 120-134
  
• Makoto Hamana:
  Universal Algebra for Termination of Higher-Order Rewriting. 135-149
  
• 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
  
• Nao Hirokawa, Aart Middeldorp:
  Tyrolean Termination Tool. 175-184
  
• Philip Wadler:
  Call-by-Value Is Dual to Call-by-Name - Reloaded. 185-203
  
• Jérôme Rocheteau:
  lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value. 204-218
  
• 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
  
• José Meseguer:
  Localized Fairness: A Rewriting Semantics. 250-263
  
• 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
  
• Olivier Bournez, Florent Garnier:
  Proving Positive Almost-Sure Termination. 323-337
  
• 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
  
• Jean-Pierre Jouannaud:
  Twenty Years Later. 368-375
  
• Nachum Dershowitz:
  Open. Closed. Open. 376-393
  
• Amy P. Felty:
  A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code. 394-406
  
• Delia Kesner, Stéphane Lengrand:
  Extending the Explicit Substitution Paradigm. 407-422
  
• Gilles Dowek, Benjamin Werner:
  Arithmetic as a Theory Modulo. 423-437
  
• Jeroen Ketema, Jakob Grue Simonsen:
  Infinitary Combinatory Reduction Systems. 438-452
  
• Robert Nieuwenhuis, Albert Oliveras:
  Proof-Producing Congruence Closure. 453-468
  
• Aaron Stump, Li-Yang Tan:
  The Algebra of Equality Proofs. 469-483
  
• Ahmed Bouajjani, Tayssir Touili:
  On Computing Reachability Sets of Process Rewrite Systems. 484-499
  
• Iovka Boneva, Jean-Marc Talbot:
  Automata and Logics for Unranked and Unordered Trees. 500-515
  

Last update Tue May 21 00:04:39 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page