Logo image
Logic program synthesis in a higher-order setting
Book chapter   Peer reviewed

Logic program synthesis in a higher-order setting

David Lacey, J Richardson and A Smaill
Computational Logic — CL 2000, pp.87-100
International Conference on Computational Logic (CL), 1st (London, United Kingdom, 24-Jul-2000–28-Jul-2000)
Lecture Notes in Computer Science (LNCS), 1861, Springer Berlin Heidelberg
2000
url
https://doi.org/10.1007/3-540-44957-4_6View
Published Version

Abstract

higher order logic illustrative examples logic programs proof planning system refinement operations
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. © Springer-Verlag Berlin Heidelberg 2000.

Details

Metrics

396 Record Views
Logo image