Logic Program Synthesis in a Higher-Order Setting

We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been implemented within the proof planning system λClam. The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given. The approach is extensible to further classes of synthesis.

• Type: Conference
• Year: 2000
• Where: CL
• Authors: David Lacey, Julian Richardson, Alan Smaill
• Keywords: Appropriate Refinement Operations, Automated Reasoning, CL 2000, Logic Programs, Proof Planning