A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
The automatic synthesis of recursive programs
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
The PSI Program Model Builder - synthesis of very high-level programs
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
The selection of efficient implementations for a high-level language
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Program inference from traces using multiple knowledge sources
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
A summary of the PSI program synthesis system
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Some rules for the automatic synthesis of programs
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Deductive synthesis of sorting programs
Journal of Symbolic Computation
Hi-index | 0.00 |
This paper presents a body of program synthesis knowledge dealing with array operations, space reutilization, the divide-and-conquer paradigm, conversion from recursive paradigms to iterative paradigms, and ordered set enumerations. Such knowledge can be used for the synthesis of efficient and in-place sorts including quicksort, mergesort, sinking sort, and bubble sort, as well as other ordered set operations such as set union, element removal, and element addition. The knowledge is explicated to a level of detail such that it is possible to codify this knowledge as a set of program synthesis rules for use by a computer-based synthesis system. The use and content of this set of programming rules is illustrated by the methodical synthesis of bubble sort, sinking sort, quicksort, and mergesort.