Summary
We synthesise versions of six well known sorting algorithms from a common specification using program transformation techniques. On the way to the sorting algorithms we synthesise three algorithms for generating permutations thus building up a family tree for the sorts exposing certain relationships between them.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. Assoc. Comput. Mach. 24, 44–67 (1977)
Clark, K., Darlington, J.: Algorithm classification through synthesis. Internal Report Department of Computing and Control, Imperial College, London, 1978. Comput. J. (to appear)
Darlington, J.: Applications of program transformation to program synthesis. Proceedings of Symposium on Proving and Improving Programs, pp. 133–144, Arc-et-Senans, France, 1975
Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976
Green, C.C., et al.: Progress report on program-understanding systems. Stanford Memo AIM 240, Stanford University, Computer Science Dept., 1974
Manna, Z., Waldinger, R.: Knowledge and reasoning in program synthesis. Artificial Intelligence 6, No. 2 (1975)
Author information
Authors and Affiliations
Additional information
An erratum to this article is available at http://dx.doi.org/10.1007/BF02915444.
Rights and permissions
About this article
Cite this article
Darlington, J. A synthesis of several sorting algorithms. Acta Informatica 11, 1–30 (1978). https://doi.org/10.1007/BF00264597
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264597