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

ostracize

An Automatic Transformation Strategy for Avoiding Unnecessary Variables in Logic Programs,ing the meaning of programs. Often one also uses variables which are ., in the sense that they are not required for describing the input-output relation. Unnecessary variables are used by the programmer because they often allow for a more transparent way of writing programs or an easier proof of the

PANG

On Using Mode Input-output for Transforming Logic Programs,irst we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we e

Insufficient

Abstract Intepretation and recursive behaviour of logic programs,ataflow analysis of a program execution and the automatic derivation of some program properties..First, we introduce a new notion: the limited-unfolding loop (abbreviated to lul). Roughly speaking, a tree t satisfies a lul m iff the leaf of the branch corresponding to the unfolding of the loop m is

声明

A保存的

Pruning Operators for Partial Evaluation,rams. For logic programs, it has been shown that, under certain conditions, a partial evaluation of a program is computationally equivalent to the original program. Unfortunately, these results only apply to programs without control directives..In this paper, we consider the difficulties of partiall

Instinctive

Specialisation of a Unification Algorithm,several specialisations of unification that are typically needed. The limitations of existing partial evaluation techniques are examined and proposals for extensions are made. Partial evaluation is modified by adding condition goals which are used to evaluate or prune more of the computation tree th

聪明

把…比做

Prolog Program Transformations and Meta-Interpreters,structured program in a more efficient program (that is to say better adapted to the interpreter or compiler). These programs are Prolog programs semantically equivalent with respect to the least Herbrand model. Our context is the operational equivalence of programs, and not the efficiency of progra

急急忙忙

Global Search Algorithms and the Constraint Logic Programming Framework,as studied in the functional programming framework in [Smith88], and in the logic programming framework in [Schaeck91]..The constraint logic programming (CLP) framework is also a very interesting tool for designing programs solving combinatorial problems. A method for designing CLP programs, based o

Carminative