Logic Program Synthesis in a Higher-Order Setting

Authors:
David Lacey;Julian Richardson;Alan Smaill
Affiliations:
-;-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 11
Cited 3

Top-down synthesis of recursive logic procedures for first-order logic specifications

Logic programming
A logic programming language with Lambda-abstraction, function variables, and simple unification

Proceedings of the international workshop on Extensions of logic programming
A logic programming approach to implementing higher-order term rewriting

ELP'91 Conference Proceedings on Extensions of logic programming
Logic program synthesis from incomplete specifications

Journal of Symbolic Computation - Special issue on automatic programming
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
Middle-out reasoning for logic program synthesis

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations

LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Forms of Logic Specifications: A Preliminary Study

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
An Integration of Deductive Retrieval into Deductive Synthesis

ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
A framework for program development based on schematic proof

IWSSD '93 Proceedings of the 7th international workshop on Software specification and design

Higher Order Function Synthesis Through Proof Planning

Proceedings of the 16th IEEE international conference on Automated software engineering
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling

Journal of Automated Reasoning
Best-First rippling

Reasoning, Action and Interaction in AI Theories and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.