Results 1 
2 of
2
Logic Program Synthesis in a HigherOrder Setting
, 2000
"... . We describe a system for the synthesis of logic programs from specications based on higherorder logical descriptions of appropriate renement operations. The system has been implemented within the proof planning system Clam. The generality of the approach is such that its extension to allow sy ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. We describe a system for the synthesis of logic programs from specications based on higherorder logical descriptions of appropriate renement 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 higherorder logic programs was straightforward. Some illustrative examples are given. The approach is extensible to further classes of synthesis. 1 Introduction Earlier work on the synthesis of logic programs has taken the approach of constructing a program in the course of proving equivalence to a specication, which is written in a richer logic than the resulting program. Typically, quantiers and thus binding of variables are present in the speci cation, and have to be manipulated correctly. We extend earlier work using as far as possible a declarative reading in a higherorder logic. The higherorder proof planning framework which we employ provides a more expressiv...
Logic Program Synthesis via Proof Planning using Clam
, 1999
"... Logic Programs are computer programs whose syntax is logic. An example of such a language is Prolog. This Msc dissertation describes a system that automatically synthesizes logic programs from their specications. This is done within a framework of theorem proving using the Clam proof planner develop ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Logic Programs are computer programs whose syntax is logic. An example of such a language is Prolog. This Msc dissertation describes a system that automatically synthesizes logic programs from their specications. This is done within a framework of theorem proving using the Clam proof planner developed in the Department of AI, Edinburgh. The developed system is partly a reimplementation of work done by Ina Kraan in her PhD awarded by the Department. However, this project extends her work greatly through its use of the higher order programming language Prolog. The system is extended to cope with synthesizing of higher order programs and programs that depend on certain assumptions about the objects they are manipulating (parameterized proofs). Acknowledgements I would rst of all like to thank my supervisors, Dr Alan Smaill and Dr Julian Richardson, for their patient and careful guidance during the course of the research reported here. Also, I thank the EPSRC who provided nancial ...