Mixed computation of Prolog programs
This paper describes theoretical as well as implementation issues involed in the design of a mix partial evaluator, starting from an interpretive specification using Prolog as the source language. First, the general theory of mixed computation is shown, together with the description of some of the problems involved in it. After this, the design of a mix partial evaluator for a subset of Prolog is explained. Here, three algorithms with increasing complexity are shown. Finally, a correctness criterion for the mix process is presented, together with the proof that the previously shown algorithms generate correct residual programs.
scientific article; zbMATH DE number 4068251
scientific article