Algebraic and Logic Programming: 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings / Edition 1

Algebraic and Logic Programming: 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings / Edition 1

by Michael Hanus
     
 

ISBN-10: 3540634592

ISBN-13: 9783540634591

Pub. Date: 09/19/1997

Publisher: Springer Berlin Heidelberg

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

Overview

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.

Product Details

ISBN-13:
9783540634591
Publisher:
Springer Berlin Heidelberg
Publication date:
09/19/1997
Series:
Lecture Notes in Computer Science Series, #1298
Edition description:
1997
Pages:
296
Product dimensions:
6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Safe folding/unfolding with conditional narrowing.- Optimal non-deterministic functional logic computations.- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints.- Parallelizing functional programs by generalization.- Higher-order equational unification via explicit substitutions.- Parameterised higher-order algebraic specifications.- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language.- On composable properties of term rewriting systems.- Needed reductions with context-sensitive rewriting.- Conditional term graph rewriting.- Lazy narrowing with parametric order sorted types.- Termination of algebraic type systems: The syntactic approach.- Proof net semantics of proof search computation.- Explicit substitutions for the—?-calculus.- A left-linear variant of—?.- Perpetuality and uniform normalization.- Model generation with existentially quantified variables and constraints.- Optimal left-to-right pattern-matching automata.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >