The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Transformation System for Developing Recursive Programs
Open accessAbstract
A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program-manipulation system is indicated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
Structured Programming with go to Statements
Knuth, D. E. (1974) · ACM Computing Surveys · doi:10.1145/356635.356640 · Cited by 678
Proving Theorems about LISP Functions
Boyer, R. S., & Moore, J. S. (1975) · Journal of the ACM · doi:10.1145/321864.321875 · Cited by 256
Floyd, R. W. (1964) · Communications of the ACM · doi:10.1145/355588.365103 · Cited by 242
A system which automatically improves programs
Darlington, J., & Burstall, R. M. (1976) · Acta Informatica · doi:10.1007/bf00263742 · Cited by 192
Self-citationKnowledge and reasoning in program synthesis
Manna, Z., & Waldinger, R. J. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90008-9 · Cited by 105
Semantics and axiomatics of a simple recursive language.
Courcelle, B., & Vuillemin, J. E. (1974) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800119.803880 · Cited by 12
Cited by
Deforestation: transforming programs to eliminate trees
Wadler, P. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90147-a · Cited by 699
Large language models for software engineering: survey and open problems
Fan, A., Gokkaya, B., Harman, M., Lyubarskiy, M., Sengupta, S., Yoo, S., & Zhang, J. M. (2023) · 2023 IEEE/ACM International Conference on Software Engineering: Future of Software Engineering (ICSE-FoSE) · doi:10.1109/icse-fose59343.2023.00008 · Cited by 650
A Deductive Approach to Program Synthesis
Manna, Z., & Waldinger, R. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357084.357090 · Cited by 573
Large Language Models for Software Engineering: Survey and Open Problems
Fan, A., Gokkaya, B., Harman, M., Lyubarskiy, M., Sengupta, S., Yoo, S., & Zhang, J. M. (2023) · arXiv · doi:10.48550/arxiv.2310.03533 · Cited by 523
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
Metadata
- Authors
- Burstall, R. M., & Darlington, J.
- Venue
- Journal of the ACM
- Published
- 1977-01
- Volume
- 24
- Issue
- 1
- Pages
- 44-67
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2023299380
- Cited by
- 1,300
- References
- 7
- FWCI
- 38.64
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Transformation System for Developing Recursive Programs. https://app.cochat.ai/papers/10.1145/321992.321996
- The paper
- Burstall, R. M., & Darlington, J. (1977). A Transformation System for Developing Recursive Programs. Journal of the ACM. https://doi.org/10.1145/321992.321996
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
