Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm

Authors:
Alessandro Armando;Alan Smaill;Ian Green
Affiliations:
University of Genova, Dipartimento di Informatica, Sistemistica e Telematica, Via all‘Opera Pia 11A, 16145 Genova, Italy. armando@dist.unige.it;University of Edinburgh, Division of Informatics, 80 South Bridge, Edinburgh EH1 1HN, Scotland. a.smaill@ed.ac.uk;University of Edinburgh, Division of Informatics, 80 South Bridge, Edinburgh EH1 1HN, Scotland. i.green@ed.ac.uk
Venue:
Automated Software Engineering
Year:
1999

Citing 16
Cited 5

Synthesis of a unification algorithm in a logic programming calculus

Journal of Logic Programming
Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Constructing recursion operators in intuitionistic type theory

Journal of Symbolic Computation
A computational logic handbook

A computational logic handbook
Terminating general recursion

BIT
Formal synthesis of a unification algorithm by the deductive-tableau method

Journal of Logic Programming
Extracting &ohgr;'s programs from proofs in the calculus of constructions

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Experiments with proof plans for induction

Journal of Automated Reasoning
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Science of Programming

The Science of Programming
Function Definition in Higher-Order Logic

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Logic Frameworks for Logic Programs

LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Implementing Contextual Rewriting

CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Deductive Composition of Astronomical Software from Subroutine Libraries

CADE-12 Proceedings of the 12th International Conference on Automated Deduction

Concept Formation via Proof Planning Failure

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An approach to automatic deductive synthesis of functional programs

Annals of Mathematics and Artificial Intelligence
Automatic deductive synthesis of lisp programs in the system ALISA

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Case-Analysis for rippling and inductive proof

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
The use of rippling to automate event-b invariant preservation proofs

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a proof method that characterises a family ofproofs corresponding to the synthesis of recursive functionalprograms. This method provides a significant degree of automation inthe construction of recursive programs from specifications, togetherwith correctness proofs. This method makes use of meta-variables toallow successive refinement of the identity of unknowns, and soallows the program and the proof to be developed hand in hand. Weillustrate it with parts of a substantial example—the synthesis ofa unification algorithm.