Titlebook: Logic Program Synthesis and Transformation; 6th International Wo John Gallagher Conference proceedings 1997 Springer-Verlag Berlin Heidelbe

bronchiole

偏離

Redundant argument filtering of logic programs,sense. Most program specialisation techniques, even though they filter arguments and remove clauses, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient residual programs. We formalise the notion of a redundant argument and show that one cannot effec

高爾夫

Replacement can preserve termination,sal termination besides computed answer substitutions. With this . we can significantly extend the safe unfold/fold transformation sequence presented in [11]. By exploiting typing information, more useful conditions can be defined and we may deal with some special cases of replacement very common in

ANTE

A transformation tool for pure Prolog programs,hat have to be satisfied before a particular transformation step can be applied. The transformation tool has been developed using a programming environment based on algebraic specification. The paper describes the tool and reports on the design decisions, the implemented transformation steps, and th

LAVE

共同時(shí)代

Abstract specialization and its application to program parallelization,s set is infinite. However, a form of specialization can still be performed in such cases by means of abstract interpretation, specialization then being with respect to abstract values (substitutions), rather than concrete ones. This paper reports on the application of abstract multiple specializati

終端

Ccu106

Inferring argument size relationships with CLP(,), We show how a precise analysis for inter-argument size relationships, formulated in terms of abstract interpretation, can be implemented straightforwardly in a language with constraint support like CLP(.) or SICStus version 3. The analysis is based on polyhedral approximations and uses a simple rel

領(lǐng)袖氣質(zhì)

Typed norms for typed logic programs, to typed ones. It is important, however, when mapping techniques across that the new techniques should exploit the type system as much as possible. In this paper, we show how norms, which play a crucial role in termination analysis, can be generated from the prescribed types of a logic program. Int

責(zé)問(wèn)

Extensible logic program schemata,ngs of schema-based transformation approaches is their reliance on a large (possibly incomplete) set of logic program schemata that is required in order to capture all of the minor syntactic differences between semantically similar logic programs. By defining a set of extensible logic program schema