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.
منابع مشابه
Logic Frameworks for Logic Programs
We show how logical frameworks can provide a basis for logic program synthesis. With them, we may use first-order logic as a foundation to formalize and derive rules that constitute program development calculi. Derived rules may be in turn applied to synthesize logic programs using higher-order resolution during proof that programs meet their specifications. We illustrate this using Paulson’s I...
متن کاملRoland Backhouse : Relational Theory of Data Types 5 David Basin : Program Synthesis as Higher Order Resolution
Introduction 4 Roland Backhouse: Relational Theory of Data Types 5 David Basin: Program Synthesis as Higher Order Resolution 6 Bettina Buth: Verification Support for Compiler Development 7 Debora Weber-Wulff: Growing Programs from Proofs 8 Jacques Loeckx (with M. Wolf): Constructive versus axiomatic and initial specifications 9 Friederike Nickl: An Algebraic/Axiomatic Interpretation of Data Flo...
متن کاملMiddle-Out Reasoning for Logic Program Synthesis
Logic programs can be synthesized as a by-product of the planning of their verification proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate ...
متن کاملIsaWhelk: Whelk Interpreted in Isabelle
The Whelk logic has been proposed as a foundation for logic program synthesis. Here, I interpret the rules of Whelk as rules of rst-order logic and derive them in Isabelle. Theoretically, this provides a means to understand the meta-theory behind Whelk, and its correctness. The interpretation suggests simpliications, corrections, and extensions. Practically, it provides a way to construct logic...
متن کاملAutomatic Program Synthesis in Second-Order Logic
Abetract A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm , has been applied to the automatic synthesis of SN0B0L-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions. Descriptive Terms Higher-order l...
متن کامل