Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (1997)
Cached
Download Links
- [ase.informatik.uni-essen.de]
- [dream.dai.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Citations: | 21 - 2 self |
BibTeX
@MISC{Armando97automaticsynthesis,
author = {Alessandro Armando and Alan Smaill and Ian Green},
title = {Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a proof plan that characterises a family of proofs corresponding to the synthesis of recursive functional programs. This plan provides a significant degree of automation in the construction of recursive programs from specifications, together with correctness proofs. This plan makes use of meta-variables to allow successive refinement of the identity of unknowns, and so allows the program and the proof to be developed hand in hand. We illustrate the plan with parts of a substantial example --- the synthesis of a unification algorithm.
