Schema-Based Transformations of Logic Programs in λProlog

摘要

This paper presents an application of higher-order logic programming: program schemata and schema-based transformations of logic programs. We are constructing higher-order programs that can unify logic programs with suitable program schemata, which are also higher-order constructs. They are abstracting out common recursive control flow patterns, and we can think about logic programs as about instances of certain program schemata. We use λProlog, because it can serve both as the language of logic programs and as the meta-language of program schemata.