Logic Program Synthesis and Transformation: Proceedings of LOPSTR '91, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, 4-5 July 1991
Springer-Verlag in collaboration with the British Computer Society, Jan 1, 1992 - Logic programming - 337 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Program Equivalence Program Development and Integrity
Synthesis and Transformation of Logic Programs from
Towards Stepwise Schemaguided Synthesis of Logic Programs
16 other sections not shown
abstract interpretation algorithm applied approach argument Artificial Intelligence atom axiom forall behaviour body Bundy clause commit label complete Computer Science condition constraints construction correct database defined definitional tree denotes derived determinisation disjuncts environment example execution expression FGDC Figure finite formula function symbols functor give given goal Godel commit ground terms Herbrand Horn clauses implementation induction inference rules input instantiated language lazy evaluation literals logic descriptions logic pro logic programs node notion object oriented operational semantics OutEnv output OutVars partial evaluation polymorphism predicate predicate symbol problem procedure program synthesis program transformation Prolog program proof properties pruning step query recursive relation replaced Req1 resolution result rewrite rules scheme semantics sequence signature SLDNF-tree soft commit solution specialised specification strategy structure subgoals subtree technique term rewriting system termination theorem theory transformation schemata true unfolding unification unified variables well-moded