Algebraic and Logic Programming: 6th International Joint Conference ALP '97 — HOA '97 Southampton, UK, September 3–5, 1997 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): M. Alpuente, M. Falaschi, G. Moreno, G. Vidal (auth.), Michael Hanus, Jan Heering, Karl Meinke (eds.)
Series: Lecture Notes in Computer Science 1298
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997

Language: English
Pages: 297
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics)

Safe folding/unfolding with conditional narrowing....Pages 1-15
Optimal non-deterministic functional logic computations....Pages 16-30
A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints....Pages 31-45
Parallelizing functional programs by generalization....Pages 46-60
Higher-order equational unification via explicit substitutions....Pages 61-75
Parameterised higher-order algebraic specifications....Pages 76-98
Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language....Pages 99-113
On composable properties of term rewriting systems....Pages 114-128
Needed reductions with context-sensitive rewriting....Pages 129-143
Conditional term graph rewriting....Pages 144-158
Lazy narrowing with parametric order sorted types....Pages 159-173
Termination of algebraic type systems: The syntactic approach....Pages 174-193
Proof net semantics of proof search computation....Pages 194-208
Explicit substitutions for the λΔ-calculus....Pages 209-223
A left-linear variant of λσ....Pages 224-239
Perpetuality and uniform normalization....Pages 240-255
Model generation with existentially quantified variables and constraints....Pages 256-272
Optimal left-to-right pattern-matching automata....Pages 273-286