Logic Program Synthesis and Transformation: Proceedings of LOPSTR 92, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, 2–3 July 1992Kung-Kiu Lau, Timothy P. Clement Logic program synthesis and transformation are topics of central importance to the software industry. The demand for software can not be met by the current supply, in terms of volume, complexity, or reliability. The most promising solution seems to be the increased automation of software production: programmer productivity would improve, and correctness could be ensured by the application of mathematical methods. Because of their mathematical foundations, logic programs lend themselves particularly well to machine-assisted development techniques, and therefore to automation. This volume contains the proceedings of the second International Workshop on Logic Program Synthesis and Transformation (LOPSTR 92), held at the University of Manchester, 2-3 July 1992. The LOPSTR workshops are the only international meetings devoted to these two important areas. A variety of new techniques were described at the workshop, all of which promise to revolutionize the software industry once they become standard practise. These include techniques for the transformation of an inefficient program into an equivalent, efficient one, and the synthesis of a program from a formal specification of its required behaviour. Among the topics covered in this volume are: optimal transformation of logic programs; logic program synthesis via proof planning; deductive synthesis of programs for query answering; efficient compilation of lazy narrowing into Prolog; synthesis of narrowing programs; Logimix: a self-applicable partial evaluator for Prolog; proof nets; automatic termination analysis. Logic Program Synthesis and Transformation describes the latest advances in machine-assisted development of logic programs. It will provide essential reading for researchers and postgraduate students concerned with these two important areas. |
Contents
Logic Program Synthesis via Proof Planning | 1 |
Deductive Synthesis of Programs for Query Answering | 15 |
Synthesis of Narrowing Programs | 30 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
abstract interpretation admissible evaluation spaces algorithm applied argument ATMS atoms auxiliary definitions base best-first search Bundy Computation Induction consider contains corresponding deductive defined definition clause deleted denote derivation elimination EOLDT structure EOLDT tree equations equivalent example expression finite folding formula free variables full Prolog function goal G Horn clauses implementation inference rules input input-output goal intensional answers label logic pro logic programs lookup member(x narrowing nat(X negation NFI-driven Induction NG-ATMS node obtained operations output partial evaluation predicate symbol Proc procedure program synthesis program transformation Prolog programs proof nets proof planning properties pure logic program query reachability recursive relational algebra relational calculus replace representation residual program RestofP result semantics SLD-strict solution table specification step strategy Structural Induction subset subset(t substitution tableau techniques termination Theorem Transformation Problem TransfP tuple unary unfolding unify unnecessary variables valid evaluation wave rules yields