6. RTA 1995: Kaiserslautern, Germany

Regular Papers

• Yuri Matiyasevich:
  On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract). 1
  
• Massimo Marchiori:
  Modularity of Completeness Revisited. 2-10
  
• Joachim Steinbach:
  Automatic Termination Proofs With Transformation Orderings. 11-25
  
• Olav Lysne, Javier Piris:
  A Termination Ordering for Higher Order Rewrite System. 26-40
  
• Hans Zantema, Alfons Geser:
  A Complete Characterization of Termination of O^p 1^q -> 1^r O^s. 41-55
  
• Robert Nieuwenhuis:
  On Narrowing, Refutation Proofs and Constraints. 56-70
  
• Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi:
  Completion for Multiple Reduction Orderings. 71-85
  
• Klaus Schmid, Roland Fettig:
  Towards an Efficient Construction of Test Sets for Deciding Ground Reducability. 86-100
  
• Mark E. Stickel:
  Term Rewriting in Contemporary Resolution Theorem Proving (Abstract). 101
  
• Andrea Asperti:
  deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. 102-116
  
• Peter Graf:
  Substitution Tree Indexing. 117-131
  
• Ilies Alouini:
  Concurrent Garbage Collection for Concurrent Rewriting. 132-146
  
• J. F. Th. Kamperman, H. R. Walters:
  Lazy Rewriting and Eager Machinery. 147-162
  
• Siva Anantharaman, Gilles Richard:
  A Rewrite Mechanism for Logic Programs with Negation. 163-178
  
• Taro Suzuki, Aart Middeldorp, Tetsuo Ida:
  Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. 179-193
  
• Géraud Sénizergues:
  A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. 194-209
  
• Wolfgang Gehrke:
  Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad. 210-224
  
• Andrea Corradini, Fabio Gadducci, Ugo Montanari:
  Relating Two Categorial Models of Term Rewriting. 225-240
  
• Stefan Kahrs:
  Towards a Domain Theory for Termination Proofs. 241-255
  
• Tobias Nipkow:
  Higher-Order Rewrite Systems (Abstract). 256
  
• Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
  Infinitary Lambda Calculi and Böhm Models. 257-270
  
• Jan Kuper:
  Proving the Genericity Lemma by Leftmost Reduction is Simple. 271-278
  
• Steffen van Bakel, Maribel Fernández:
  (Head-) Normalization of Typeable Rewrite Systems. 279-293
  
• Pierre Lescanne, Jocelyne Rouyer-Degli:
  Explicit Substitutions with de Bruijn's Levels. 294-308
  
• Richard J. Boulton:
  A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics. 309-323
  
• H. R. Walters, Hans Zantema:
  Rewrite Systems for Integer Arithmetic. 324-338
  
• Habib Abdulrab, Marianne Maksimenko:
  General Solution of Systems of Linear Diophantine Equations and Inequations. 339-351
  
• Franz Baader, Klaus U. Schulz:
  Combination of Constraint Solving Techniques: An Algebraic POint of View. 352-366
  
• Friedrich Otto, Paliath Narendran, Daniel J. Dougherty:
  Some Independent Results for Equational Unification. 367-381
  
• Jochen Burghardt:
  Regular Substitution Sets: A Means of Controlling E-Unification. 382-396
  

System Description

• Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs:
  DISCOUNT: A SYstem for Distributed Equational Deduction. 397-402
  
• Françoise Bellegarde:
  ASTRE: Towards a Fully Automated Program Transformation System. 403-407
  
• Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin:
  Parallel ReDuX -> PaReDuX. 408-413
  
• Ta Chen, Siva Anantharaman:
  STORM: A MAny-to-One Associative-Commutative Matcher. 414-419
  
• Jacques Chazarain, Serge Muller:
  LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories. 420-425
  
• Jürgen Giesl:
  Generating Polynomial Orderings for Termination Proofs. 426-431
  
• M. Randall Holmes:
  Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2. 432-437
  
• Hélène Kirchner, Pierre-Etienne Moreau:
  Prototyping Completion with Constraints Using Computational Systems. 438-443
  
• Alberto Paccanaro:
  Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory. 444-449
  

Problem Sets

• Mark E. Stickel, Hantao Zhang:
  Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results. 450-456
  
• Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
  Problems in Rewriting III. 457-471
  

Last update Fri May 25 08:34:37 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page