Program derivation through transformations: The evolution of list-copying algorithms
- 1 January 1986
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 6, 213-272
- https://doi.org/10.1016/0167-6423(86)90026-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The promotion and accumulation strategies in transformational programmingACM Transactions on Programming Languages and Systems, 1984
- Structuring transformational developments: A case study based on earley's recognizerScience of Computer Programming, 1984
- Analysis of pointer “rotation”Communications of the ACM, 1982
- Deductive synthesis of the unification algorithmScience of Computer Programming, 1981
- A fast algorithm for copying list structuresCommunications of the ACM, 1978
- A bounded storage algorithm for copying cyclic structuresCommunications of the ACM, 1977
- Proof Theory of Partial Correctness Verification SystemsSIAM Journal on Computing, 1976
- Copying cyclic list structures in linear time using bounded workspaceCommunications of the ACM, 1975
- Copying list structures using bounded workspaceCommunications of the ACM, 1974
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967