Logic Program Synthesis and Transformation: Proceedings of LOPSTR 92, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, 2-3 July 1992 - Couverture souple
Synopsis
Logic Program Synthesis via Proof Planning.- Deductive Synthesis of Programs for Query Answering.- Synthesis of Narrowing Programs.- A Unifying View of Structural Induction and Computation Induction for Logic Programs.- Proof Nets.- The LOPS Approach: A Transformational Point of View (Extended Abstract).- Best-first Strategies for Incremental Transformations of Logic Programs.- Deriving Transformations of Logic Programs Using Abstract Interpretation.- A Rationalisation of the ATMS in Terms of Partial Evaluation.- Intensional Query Answering: An Application of Partial Evaluation.- Deletion of Redundant Unary Type Predicates from Logic Programs.- Automatic Termination Analysis.- Application of Unfolding in Prolog Programming.- An Unfold Rule for Full Prolog.- Logimix: A Self-Applicable Partial Evaluator for Prolog.- Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.- On the Transformation of a prolog Program to a More Efficient Binary Program.- Efficient Compilation of Lazy Narrowing into Prolog.- Author Index.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
