Logic Program Specialisation through Partial Deduction

Title: Logic Program Specialisation through Partial Deduction

Research Question: How can we improve the performance of logic programs by using partial deduction?

Methodology: The study uses a technique called partial deduction, which involves evaluating a program with only part of its input known at the start (static input). The remaining part of the input (dynamic input) is filled in at a later time. The partial evaluator then generates a more efficient program that computes the same output as the original program, but only for inputs that match the static input.

Results: The research found that partial deduction can significantly improve the performance of logic programs. The study presents several examples of how this technique can be applied to various programming languages, including functional, logic, and functional-logic programming languages.

Implications: The results of this research have important implications for the field of programming. By using partial deduction, programmers can create more efficient programs that can handle a wider range of inputs. This technique can also be applied to other areas of computer science, such as type theory and term rewriting systems.

Link to Article: https://arxiv.org/abs/0202012v1 Authors: arXiv ID: 0202012v1