Logic Program Synthesis and Transformation: 7th International Workshop, LOPSTR’97 Leuven, Belgium, July 10–12, 1997 Proceedings

W. Bibel, D. Korn, C. Kreitz, F. Kurucz (auth.), Norbert E. Fuchs (eds.)3540650741, 9783540650744

This volume contains the papers from the Seventh International Workshop on Logic Program Synthesis and Transformation, LOPSTR ’97, that took place in Leuven, Belgium, on July 10–12, 1997, ‘back to back’ with the Fourteenth International Conference on Logic Programming, ICLP ’97. Both ICLP and LOPSTR were organised by the K.U. Leuven Department of Computer Science. LOPSTR ’97 was sponsored by Compulog Net and by the Flanders Research Network on Declarative Methods in Computer Science. LOPSTR ’97 had 39 participants from 13 countries. There were two invited talks by Wolfgang Bibel (Darmstadt) on ‘A multi level approach to program synthesis’, and by Henning Christiansen (Roskilde) on ‘Implicit program synthesis by a reversible metainterpreter’. Extended versions of both talks appear in this volume. There were 19 technical papers accepted for presentation at LOPSTR ’97, out of 33 submissions. Of these, 15 appear in extended versions in this volume. Their topics range over the fields of program synthesis, program transformation, program analysis, tabling, metaprogramming, and inductive logic programming.

---

Table of contents :
A Multi-level Approach to Program Synthesis….Pages 1-27
Programs Without Failures….Pages 28-48
Generalised Logic Program Transformation Schemas….Pages 49-68
Logic Program Schemas, Constraints, and Semi-unification….Pages 69-89
Implicit Program Synthesis by a Reversible Metainterpreter….Pages 90-110
Termination Analysis for Tabled Logic Programming….Pages 111-127
On Correct Program Schemas….Pages 128-147
Analysis of Logic Programs with Delay….Pages 148-167
Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs….Pages 168-188
Preserving Termination of Tabled Logic Programs While Unfolding (Extended Abstract)….Pages 189-205
Unfolding the Mystery of Mergesort ….Pages 206-225
Towards a Logic for Reasoning About Logic Programs Transformation….Pages 226-244
A Higher Order Reconstruction of Stepwise Enhancement….Pages 245-262
Development of Correct Transformation Schemata for Prolog Programs….Pages 263-281
Constrained Regular Approximation of Logic Programs….Pages 282-299
A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories….Pages 300-321
To Parse or Not To Parse….Pages 322-342