Algebraic and Logic Programming: 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings
Michael Hanus, Jan Heering, Karl Meinke
Springer Science & Business Media, Aug 20, 1997 - Computers - 297 pages
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.
Functional and Logic Programming
Alpuente M Falaschi G Moreno and G Vidal
Parallelizing Functional Programs by Generalization
A Geser and S Gorlatch
Kirchner and C Ringeissen
A Computation Model for
On Composable Properties of Term Rewriting Systems
T Aoto and Y Toyama
The Syntactic Approach
Proof Net Semantics of Proof Search Computation
Caires and L Monteiro
Other editions - View all
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