Buch, Englisch, Band 1463, 343 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 534 g
7th International Workshop, LOPSTR '97, Leuven, Belgium, July 10-12, 1997 Proceedings
Buch, Englisch, Band 1463, 343 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 534 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-65074-4
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
A Multi-level Approach to Program Synthesis.- Programs Without Failures.- Generalised Logic Program Transformation Schemas.- Logic Program Schemas, Constraints, and Semi-unification.- Implicit Program Synthesis by a Reversible Metainterpreter.- Termination Analysis for Tabled Logic Programming.- On Correct Program Schemas.- Analysis of Logic Programs with Delay.- Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs.- Preserving Termination of Tabled Logic Programs While Unfolding (Extended Abstract).- Unfolding the Mystery of Mergesort.- Towards a Logic for Reasoning About Logic Programs Transformation.- A Higher Order Reconstruction of Stepwise Enhancement.- Development of Correct Transformation Schemata for Prolog Programs.- Constrained Regular Approximation of Logic Programs.- A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories.- To Parse or Not To Parse.
