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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90016-4 · Cited by 1,002
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
An Efficient Unification Algorithm
Martelli, A., & Montanari, U. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357169 · Cited by 776
A specifier's introduction to formal methods
Wing, J. M. (1990) · Computer · doi:10.1109/2.58215 · Cited by 736
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
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
“The generate-and-test approach offers greater code transformation freedom (compared to more traditional correct-by-construction approaches [47]), precisely because the generated code may not preserve strict, mathematically-defined (and not always appropriate, nor useful) interpretations of…”
BackgroundCombinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
Pfenning, F., & Elliott, C. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54010 · Cited by 581
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
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
Prolegomena to a theory of mechanized formal reasoning
Weyhrauch, R. W. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90015-6 · Cited by 429
Conception, evolution, and application of functional programming languages
Hudak, P. (1989) · ACM Computing Surveys · doi:10.1145/72551.72554 · Cited by 409
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
The concept of a supercompiler
Turchin, V. F. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5956.5957 · Cited by 363
Program Transformation Systems
Partsch, H., & Steinbrüggen, R. (1983) · ACM Computing Surveys · doi:10.1145/356914.356917 · Cited by 346
Views: a way for pattern matching to cohabit with data abstraction
Wadler, P. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41653 · Cited by 321
Tutorial notes on partial evaluation
Consel, C., & Danvy, O. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158707 · Cited by 316
Reformulating software engineering as a search problem
Clarke, J., Dolado, J. J., Harman, M., Hierons, R., Jones, B., Lumkin, M., Mitchell, B., Mancoridis, S., Rees, K., Roper, M., et al. (2003) · IEE Proceedings - Software · doi:10.1049/ip-sen:20030559 · Cited by 286
Finite Differencing of Computable Expressions
Paige, R., & Koenig, S. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357177 · Cited by 281
A logic-based framework for attribute based access control
Wang, L., Wijesekera, D., & Jajodia, S. (2004) · Proceedings of the 2004 ACM workshop on Formal methods in security engineering · doi:10.1145/1029133.1029140 · Cited by 268
Harman, M., Hu, L., Hierons, R., Wegener, J., Sthamer, H., Baresel, A., & Roper, M. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.1265732 · Cited by 265
Degano, P. (1983) · Pictorial Data Analysis · doi:10.1007/978-3-642-82017-5_12 · Cited by 265
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
(1987) · Cited by 128
Conjunctive partial deduction: foundations, control, algorithms, and experiments
De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., & Sørensen, M. H. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00030-8 · Cited by 96
“Unfold/fold transformations have been studied by Tamaki and Sato, Pettorossi and Proietti, and others [74, 62], and was originally introduced by Burstall and Darlington [12] in functional programming.”
MethodControlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Mixtus: An automatic partial evaluator for full Prolog
Sahlin, D. (1993) · New Generation Computing · doi:10.1007/bf03038271 · Cited by 86
Narrowing-driven partial evaluation of functional logic programs
Alpuente, M., Falaschi, M., & Vidal, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61055-3_28 · Cited by 40
Semantics preserving transformation rules for Prolog
Proietti, M., & Pettorossi, A. (1991) · Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '91 · doi:10.1145/115865.115895 · Cited by 40
Top-Down Synthesis for Library Learning
Bowers, M., Olausson, T. X., Wong, L., Grand, G., Tenenbaum, J. B., Ellis, K., & Solar-Lezama, A. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571234 · Cited by 33
Online partial deduction of logic programs
Prestwich, S. (1993) · Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93 · doi:10.1145/154630.154642 · Cited by 18
Transformation of left terminating programs: The reordering problem
Bossi, A., Cocco, N., & Etalle, S. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60939-3_3 · Cited by 18
Enhancing Code Generation via Bidirectional Comment-Level Mutual Grounding
Di, Y., & Zhang, T. (2025) · arXiv · doi:10.48550/arxiv.2505.07768 · Cited by 3
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
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.