Titlebook: Logic Program Synthesis and Transformation; 7th International Wo Norbert E. Fuchs Conference proceedings 1998 Springer-Verlag Berlin Heidel

ABHOR

ANNUL

果仁

Logic Program Schemas, Constraints, and Semi-unification,aper tackles two complementary aspects of program schemas. We first propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and specific features of program schemas. One of the basic operations on schemas is the semi-unifica

Lacunar-Stroke

Motilin

CYT

On Correct Program Schemas,esent schemas purely syntactically as higher-order expressions, we shall express a schema as an open first-order theory that axiomatises a problem domain, called a ., containing an open program that represents the template of the schema. We will show that using our approach we can define a meaningfu

提煉

Analysis of Logic Programs with Delay,ar, groundness. A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. An implementation has been built which shows that the analysis can be both accurate and efficient.

有機體

Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs,based information propagation. The constraint-based partial evaluation algorithm incorporated with local and global control describes a KMP partial evaluator. Results from the implementation of the partial evaluator in the functional logic language Escher show that the algorithm is also able to perf

calamity

四目在模仿

Unfolding the Mystery of , ,t work directly. The transformation consists of creating adorned clauses and unfolding. In general, the transformation may improve termination behavior by pruning infinite branches from the LD-tree. Conditions are given under which the transformation preserves termination behavior. The work presente