2. ALP 1990: Nancy, France

Invited Talk

• Joseph A. Goguen:
  Proving and Rewriting. 1-24
  

Session 1

• Jordi Farrés-Casals:
  Proving Correctness wrt Specifications with Hidden Parts. 25-39
  
• H. R. Walters:
  Hybrid Implementations of Algebraic Specifications. 40-54
  

Session 2

• Françoise Debart, Patrice Enjalbert, Madeleine Lescot:
  Multi-Modal Logic Programming using Equational and Order-Sorted Logic. 55-69
  
• Michael Hanus:
  Logic Programs with Equational Type Specifications (Extended Abstract). 70-85
  
• Zhenyu Qian:
  Higher-Order Order-Sorted Algebras. 86-100
  
• François Bronsard, Uday S. Reddy:
  Axiomatization of a Functional Logic Language. 101-116
  

Invited Talk

• Tien Huynh, Catherine Lassez, Jean-Louis Lassez:
  Fourier Algorithm Revisited. 117-131
  

Session 3

• Aïda Batarekh:
  Fixpoint Techniques for Non-Monotone Maps. 132-143
  
• Yuli Zhou, Robert Muller:
  Domain Theory for Nonmonotonic Functions. 144-157
  
• Phan Minh Dung:
  On the strong completion of logic programs. 158-172
  
• Taisuke Sato:
  An Equivalence Preserving First Order Unfold/fold Transformation System. 173-188
  

Session 4

• Helmut Simonis, Mehmet Dincbas:
  Propositional Calculus Problems in CHIP. 189-203
  
• Maurizio Gabbrielli, Giorgio Levi:
  Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs. 204-216
  
• Kanchana Kanchanasut, Peter J. Stuckey:
  Eliminating Negation from Normal Logic Programs. 217-231
  

Session 5

• Patrick Saint-Dizier:
  On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logic. 232-246
  
• Jia Liang Han:
  Recursive Query Processing in Predicate-Goal Graph. 247-261
  

Invited Talk

• Pierre Lescanne:
  Implementations of Completion by Transition Rules + Control: ORME. 262-269
  

Session 6

• Françoise Bellegarde:
  A Matching Process Modulo a Theory of Categorical Products. 270-282
  
• Nachum Dershowitz, Subrata Mitra, G. Sivakumar:
  Equation Solving in Conditional AC-Theories. 283-297
  
• Juan José Moreno-Navarro, Herbert Kuchen, Rita Loogen, Mario Rodríguez-Artalejo: Lazy Narrowing in a Graph Machine. 298-317 , ->BABEL
• Nachum Dershowitz, Naomi Lindenstrauss:
  An Abstract Concurrent Machine for Rewriting. 318-331
  

Session 7

• Reinhard Bündgen:
  Applying Term Rewriting Methods to Finite Groups. 332-346
  
• Dieter Hofbauer:
  Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. 347-358
  
• Ke Li:
  Optimization of Rewriting and Complexity of Rewriting. 359-371
  
• Joachim Steinbach:
  AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering. 372-386