Logic programming synthesis and transformation are methods of deriving logic programs from their specifications and, where necessary, producing alternative but equivalent forms of a given program. The techniques involved in synthesis and transformation are extremely important as they allow the systematic construction of correct and efficient programs and have the potential to enhance current methods of software production. Transformation strategies are also being widely used in the field of logic program development. LOPSTR 91 was the first workshop to deal exclusively with both logic program synthesis and transformation and, as such, filled an obvious gap in the existing range of logic programming workshops. In attempting to cover the subject as comprehensively as possible, the workshop brought together researchers with an interest in all aspects of logic (including Horn Clause and first order logic) and all approaches to program synthesis and transformation. Logic Program Synthesis and Transformation provides a complete record of the workshop, with all the papers reproduced either in full or as extended abstracts. They cover a wide range of aspects, both practical and theoretical, including the use of mode input-output in program transformation, program specification and synthesis in constructive formal systems and a case study in formal program development in modular Prolog. This volume provides a comprehensive overview of current research and will be invaluable to researchers and postgraduate students who wish to enhance their understanding of logic programming techniques.

Inhalt
Program Equivalence, Program Development and Integrity Checking.- Program Specification and Synthesis in Constructive Formal Systems.- Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof.- Towards Stepwise, Schema-guided Synthesis of Logic Programs.- Inductive Synthesis of Rewrite Rules as Program Synthesis (Extended Abstract).- Formal Program Development in Modular Prolog: A Case Study.- Towards Synthesis of Nearly Pure Prolog Programs (Extended Abstract).- Formal Validation of Transformation Schemata.- Schema-Based Transformations of Logic Programs.- An Automatic Transformation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract).- On Using Mode Input-output for Transforming Logic Programs.- Abstract Interpretation and Recursive Behaviour of Logic Programs.- Speed-up Transformations of Logic Programs by Abstraction and Learning.- Pruning Operators for Partial Evaluation.- Specialisation of a Unification Algorithm.- Semantics-based Partial Evaluation of Prolog Programs.- Prolog Program Transformations and Meta-Interpreters.- Global Search Algorithms and the Constraint Logic Programming Framework (Extended Abstract).- Automated Translation of Occam to a Concurrent Logic Language.- A Method for the Determinisation of Propositional Temporal Formulae.- Program Transformations Directed by the Evaluation of non Functional Properties (Extended Abstract).- Using a Prolog Prototype for Designing an Object Oriented Scheme.- Non-Determinism and Lazy Evaluation in Logic Programming.- Query Optimisation in an Object-Oriented Database using Prolog (Extended Abstract).- Author Index.