Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Yves Deville (Chair) Conference proceedings 1994 British Computer Society

relieve

審問(wèn)

Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model,in a framework called the basic Andorra model, which allows (dependent) and-parallelism among determinate goals as well as or-parallelism. We show that it is possible to extend this model in order to also allow and-parallelism among independent, nondeterminate goals, thus supporting full independent

枯燥

Memoing with Abstract Answers and Delphi Lemmas,er obtained by replicating the steps of the derivation, except the first one. After describing a meta-interpreter returning abstract answers we derive a class of program transformations that compute them more efficiently. Abstract answers are ideal lemmas as their `hit rate’ is much higher than in t

武器

哥哥噴涌而出

Mechanical Transformation of Logic Definitions augmented with Type Information into Prolog Procedurcedures. The presented static analyser can be used in a final transformation component of a logic program synthesis system such as the systems described in [8, 18]. The paper recalls the notion of a logic description and discusses how type information can be used to relate the logic description to i

outskirts

Using Abstract Interpretation for Goal Replacement,e well known unfold/fold and goal replacement transformations of Tamaki and Sato which are based upon goal replacement in the bodies of clauses. The transformation of a program is controlled by a complete abstract OLDT-like tree. The transformation operations include unfolding/folding and goal replacement.

強(qiáng)制令

Trochlea

Confidential

The Power of Partial Evaluation, of this meta-program that is amenable to specialisation and show that partial evaluation of this program with respect to some object theory can give results comparable to the results obtained by a special purpose analysis.

圍巾

A Transformation Based on the Equality between Terms,of existential variables in programs using difference lists and accumulators, reduction of the number of occur-checks, interprocedural register allocation when executed on the WAM, linearization of recursions, optimization of continuation-like user data structures.