10. RTA 1999: Trento, Italy

Session 1

• Robert Nieuwenhuis, José Miguel Rivero:
  Solved Forms for Path Ordering Constraints. 1-15
  
• Nachum Dershowitz, Subrata Mitra:
  Jeopardy. 16-29
  
• Eelco Visser:
  Strategic Pattern Matching. 30-44
  

Session 2

• Philippe de Groote:
  On the Strong Normalisation of Natural Deduction with Permutation-Conversions. 45-59
  
• Vincent van Oostrom:
  Normalisation in Weakly Orthogonal Rewriting. 60-74
  
• Roberto Di Cosmo, Stefano Guerrini:
  Strong Normalization of Proof Nets Modulo Structural Congruences. 75-89
  

Session 3: Invited Talk

• Bruno Courcelle:
  Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. 90-91
  

Session 4

• Jerzy Marcinkowski:
  Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. 92-102
  
• Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi:
  Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. 103-117
  
• Sébastien Limet, Pierre Réty:
  A New Result about the Decidability of the Existential One-Step Rewriting Theory. 118-132
  

Session 5

• Albert Rubio:
  A Fully Syntactic AC-RPO. 133-147
  
• Jürgen Stuber:
  Theory Path Orderings. 148-162
  
• Hélène Touzet:
  A Characterisation of Multiply Recursive Functions with Higman's Lemma. 163-174
  

Session 6

• Franz Baader, Cesare Tinelli:
  Deciding the Word Problem in the Union of Equational Theories Sharing Constructors. 175-189
  
• Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari:
  Normalization via Rewrite Closures. 190-204
  
• Dieter Hofbauer, Maria Huber:
  Test Sets for the Universal and Existential Closure of Regular Tree Languages. 205-219
  

Session 7: Invited Tutorial

• Femke van Raamsdonk:
  Higher-Order Rewriting. 220-239
  

Session 8: System Description

• Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada:
  The Maude System. 240-243
  
• Francisco Javier López-Fraguas, Jaime Sánchez-Hernández:
  TOY: A Multiparadigm Declarative System. 244-247
  
• Stephan Kepser, Jörn Richts:
  UNIMOK: A System for Combining Equational Unification Algorithm. 248-251
  
• Rakesh M. Verma, Shalitha Senanayake:
  L^arrowR²: A Laboratory fro Rapid Term Graph Rewriting. 252-255
  

Session 9

• Takashi Nagaya, Yoshihito Toyama:
  Decidability for Left-Linaer Growing Term Rewriting Systems. 256-270
  
• Jürgen Giesl, Aart Middeldorp:
  Transforming Context-Sensitive Rewrite Systems. 271-287
  
• Maria C. F. Ferreira, A. L. Ribeiro:
  Context-Sensitive AC-Rewriting. 286-300
  

Session 10

• Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
  The Calculus of algebraic Constructions. 301-316
  
• Gilles Dowek, Thérèse Hardin, Claude Kirchner:
  HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic. 317-331
  

Session 11: Invited Talk

• Friedrich Otto:
  On the Connections between Rewriting and Formal Language Theory. 332-355
  

Session 12

• Christiane Frougny, Jacques Sakarovitch:
  A Rewrite System Associated with Quadratic Pisot Units. 356-370
  
• Manfred Göbel:
  Fast Rewriting of Symmetric Polynomials. 371-381
  
• Frédéric Saubion, Igor Stéphan:
  On Implementation of Tree Synchronized Languages. 382-396
  

Last update Thu May 24 04:41:32 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page