4. ALP 1994: Madrid, Spain

Invited Talks (Abstracts)

• Catuscia Palamidessi:
  Concurrent Constraint Programming. 1-2
  
• Dale Miller:
  Specifications Using Multiple-Conclusion Logic Programs. 3-4
  
• Robert Paige:
  Viewing A program Transformation System At Work. 5
  

Theorem Proving

• Michael Codish, Grigory Mashevitzky:
  Proving Implications by Algebraic Approximation. 6-22
  
• Adel Bouhoula:
  Sufficient Completeness and Parameterized Proofs by Induction. 23-40
  
• Michel Bidoit, Rolf Hennicker:
  Proving Behavioural Theorems with Standard First-Order Logic. 41-58
  

Narrowing

• Andreas Werner, Alexander Bockmayr, Stefan Krischer:
  How to Realize LSE Narrowing. 59-76
  
• María Alpuente, Moreno Falaschi, Germán Vidal:
  Compositional Analysis for Equational Horn Programs. 77-94
  
• Philippe Balbiani:
  Equation Solving in Projective Planes and Planar Ternary Rings. 95-113
  

Logic Programming I

• Francisco Bueno, Manuel V. Hermenegildo, Ugo Montanari, Francesca Rossi:
  From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics. 114-132
  
• Paolo Volpe:
  Concurrent Logic Programming as Uniform Linear Proofs. 133-149
  
• Frank Teusink:
  Three-Valued Completion for Abductive Logic Programs. 150-167
  

Term Rewriting

• Sergio Antoy, Aart Middeldorp:
  A Sequential Reduction Strategy. 168-185
  
• Bernhard Gramlich:
  On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. 186-203
  
• Maria C. F. Ferreira, Hans Zantema:
  Syntactical Analysis of Total Termination. 204-222
  
• Massimo Marchiori:
  Logic Programs as term Rewriting Systems. 223-241
  

Higher-Order Programming

• Neil D. Jones, Mads Rosendahl:
  Higher-Order Minimal Functional Graphs. 242-252
  
• Delia Kesner:
  Reasoning about Layered, Wildcard and Product Patterns. 253-268
  

Logic Programming II

• Annalisa Bossi, Nicoletta Cocco:
  Preserving Universal Termination through Unfold/Fold. 269-286
  
• Elena Marchiori:
  A Logic for Variable Aliasing in Logic Programs. 287-304