Partial evaluation of the “real thing”

By partially evaluating a meta-interpreter for certain transaction patterns, using a partial evaluation technique presented in earlier work, the authors automatically obtain very efficient specialised update procedures that execute faster than other integrity checking procedures proposed in the literature.

“By partially evaluating this meta-interpreter for certain transaction patterns, using a partial evaluation technique presented in earlier work, we are able to automatically obtain very efficient specialised update procedures, executing faster than other integrity checking procedures proposed in the literature.”

By partially evaluating a meta-interpreter for certain transaction patterns, using a partial evaluation technique presented in earlier work, the authors automatically obtain very efficient specialised update procedures that execute faster than other integrity checking procedures proposed in the literature.

“By partially evaluating this meta-interpreter for certain transaction patterns, using a partial evaluation technique presented in earlier work, we are able to automatically obtain very efficient specialised update procedures, executing faster than other integrity checking procedures proposed in the literature.”

[48] uses a freeness and sharing analysis to produce more efficient specialised programs by removing useless bindings as well as useless if-then-else tests.

“The exact details on how to unfold the if-then-else can be found in [48], where a freeness and sharing analysis are used to produce more efficient specialised programs by removing useless bindings as well as useless if-then-else tests.”

The method of [48] tries to strictly enforce the Prolog left-to-right selection rule.

“The method of [48] tries to strictly enforce the Prolog left-to-right selection rule.”

[48] extends the concept of LD-derivations and LD-trees to LDR-derivations and LDR-trees, which in addition to left-most resolution steps also contain residualisation steps.

“[48] extends the concept of LD-derivations and LD-trees to LDR-derivations and LDR-trees, which in addition to left-most resolution steps also contain residualisation steps.”

Residualisation steps remove the left-most atom from the goal and hide it from the left-propagations of bindings.

“The latter remove the left-most atom from the goal and hide it from the left-propagations of bindings.”

Useless if-then-else tests often occur when predicates with output arguments are used inside the test-part of an if-then-else.

“The latter often occur when predicates with output arguments are used inside the test-part of an if-thenelse.”

The partial evaluator LEUPEL and a prototype [49] based upon it can generate specialised update procedures fully automatically.

“We have drawn upon the techniques in [48] and presented the partial evaluator LEUPEL and a prototype [49] based upon it, which can generate specialised update procedure fully automatically.”

The partial evaluator LEUPEL and a prototype [49] based upon it can generate specialised update procedures fully automatically.

“We have drawn upon the techniques in [48] and presented the partial evaluator LEUPEL and a prototype [49] based upon it, which can generate specialised update procedure fully automatically.”