Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Kung-Kiu Lau,Timothy Paul Clement Conference proceedings 1993 Springer-Ver

安抚

Synthesis of Narrowing Programs,he operations which we use to compute. The goal represents the program requirements, denoting relations between input-output variables. Our method demonstrates how program synthesis techniques can be used to optimize narrowing. The synthesis method is formulated as an . for extracting a rewrite prog

Constrain

A Unifying View of Structural Induction and Computation Induction for Logic Programs,e of a Prolog program synthesized through Proof-Extraction techniques, and rests on extensive use of Negation as Failure Inference for exploiting the information contained in the extracted program. A comparison is made between the new rule and the rules of Restricted Structural Induction [Fri 90] an

BOGUS

Proof Nets, . of proofs as programs, adequate representations of proofs are required. In this paper we propose to represent proofs by a kind of Predicate Transition Petri Nets. Net representation gives rise to an immediate reading of the computational aspects of proofs and allows to treat various logics in an

thwart

痛恨

Gratuitous

A Rationalisation of the ATMS in Terms of Partial Evaluation,d to deal with the non-ground case, can be interpreted as an optimised version of a logic program, comparable to that obtained by applying source-to-source transformation techniques such as partial evaluation. Moreover, the ATMS algorithm can be interpreted as an incremental transformation scheme fo

Decrepit

bourgeois

Automatic Termination Analysis,f a program can very easily be dealt with in two separate phases of the development, the termination issue is solely addressed in the second phase. Both formal, theoretical frameworks for reasoning about termination, and automatic techniques for termination analysis have recently obtained considerab

Flustered

Militia

An Unfold Rule for Full Prolog,rule is very simple for pure Prolog, it has many problems when applied to full Prolog. This paper proposes an approach which removes most of these problems, making the design of transformation tools less complex and error-prone. A way of simplifying program structure is described, so that unfolding