6. ALP / 3. HOA 1997: Southampton, U.K.

Functional and Logic Programming

• María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal:
  Safe Folding/Unfolding with Conditional Narrowing. 1-15
  
• Sergio Antoy:
  Optimal Non-deterministic Functional Logic Computations. 16-30
  
• Michael Codish, Cohavit Taboch:
  A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. 31-45
  
• Alfons Geser, Sergei Gorlatch:
  Parallelizing Functional Programs by Generalization. 46-60
  

Higher-Order Methods

• Claude Kirchner, Christophe Ringeissen:
  Higher-Order Equational Unification via Explicit Substitutions. 61-75
  
• L. J. Steggles:
  Parameterised Higher-Order Algebraic Specifications. 76-98
  
• Taro Suzuki, Koji Nakagawa, Tetsuo Ida:
  Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language. 99-113
  

Term Rewriting

• Takahito Aoto, Yoshihito Toyama:
  On Composable Properties of Term Rewriting Systems. 114-128
  
• Salvador Lucas:
  Needed Reductions with Context-Sensitive Rewriting. 129-143
  
• Enno Ohlebusch:
  Conditional Term Graph Rewriting. 144-158
  

Types

• Jesús Manuel Almendros-Jiménez, Ana Gil-Luezas:
  Lazy Narrowing with Parametric Order Sorted Types. 159-173
  
• Gilles Barthe, Femke van Raamsdonk:
  Termination of Algebraic Type Systems: The Syntactic Approach. 174-193
  
• Luís Caires, Luís Monteiro:
  Proof Net Semantics of Proof Search Computation. 194-208
  

Lambda-Calculus

• Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos:
  Explicit Substitutions for the Lambda-Calculus. 209-223
  
• A. César, H. Muñoz:
  A Left-Linear Variant of Lambda-Sigma. 224-239
  
• Zurab Khasidashvili, Mizuhito Ogawa:
  Perpetuality and Uniform Normalization. 240-255
  

Theorem Proving Methods

• Slim Abdennadher, Heribert Schütz:
  Model Generation with Existentially Quantified Variables and Constraints. 256-272
  
• Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge:
  Optimal Left-to-Right Pattern-Matching Automata. 273-286