## Algebraic and Logic Programming: 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. ProceedingsMichael Hanus, Jan Heering, Karl Meinke This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997. The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Functional and Logic Programming | 1 |

Alpuente M Falaschi G Moreno and G Vidal | 14 |

S Antoy | 30 |

Parallelizing Functional Programs by Generalization | 46 |

A Geser and S Gorlatch | 60 |

Kirchner and C Ringeissen | 75 |

A Computation Model for | 99 |

On Composable Properties of Term Rewriting Systems | 114 |

T Aoto and Y Toyama | 128 |

S Lucas | 143 |

Types | 159 |

The Syntactic Approach | 174 |

Proof Net Semantics of Proof Search Computation | 194 |

Caires and L Monteiro | 208 |

### Other editions - View all

Algebraic and Logic Programming: 6th International Joint Conference, ALP '97 ... Michael Hanus,Jan Heering,Karl Meinke No preview available - 2014 |

### Common terms and phrases

abstract algebraic algebraic type system application argument assume atoms automaton binary bound branch calculus called combination complete Computer Computer Science confluent consider consists constraints construction constructor contains context corresponding defined Definition denoted derivation equational equivalent Example exists explicit substitutions expressions extended first-order function function symbols given goal ground Hence higher-order implies induction infinite instance introduce language Lemma Logic Programming matching method minimal multiset narrowing normal form Note notion obtained occurrence operation orthogonal pair parameter parameterised pattern perpetual position present preservation problem Proceedings proof Proposition prove pure redexes reduction relation replacement require respectively restricted rewrite rule rule satisfies semantics side solution solved sort specification step strategy structure substitution subterm technique term rewriting system termination Theorem theory transformation tree TRSs unfolding unification universal variables

### Popular passages

Page 238 - In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 398—407, La Jolla, San Diego, 26—29 July 1995.