The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Proving Properties of Programs by Structural Induction
Abstract
This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without assignments or jumps. Some syntactic extensions to Landin's functional programming language ISWIM are suggested which make it easier to program the manipulation of data structures and to develop proofs about such programs. Two sample proofs are given to demonstrate the technique, one for a tree sorting algorithm and one for a simple compiler for expressions.
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
Grätzer, G. (1968) · Cited by 2,320
The Mechanical Evaluation of Expressions
Landin, P. J. (1964) · The Computer Journal · doi:10.1093/comjnl/6.4.308 · Cited by 926
A Basis for a Mathematical Theory of Computation )
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72018-4 · Cited by 692
The next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 661
A Basis for a Mathematical Theory of Computation
(1959) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(09)70099-0 · Cited by 321
Advances in Programming and Non-Numerical Computation
(1966) · Elsevier eBooks · doi:10.1016/c2013-0-01911-1 · Cited by 38
Cited by
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
An axiomatic basis for computer programming
Hoare, C. A. R. (1983) · Communications of the ACM · doi:10.1145/357980.358001 · Cited by 1,521
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
The origins of structural operational semantics
Plotkin, G. D. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.03.009 · Cited by 362
MCBRIDE, C., & MCKINNA, J. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004829 · Cited by 327
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
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
Toward automatic program synthesis
Manna, Z., & Waldinger, R. J. (1971) · Communications of the ACM · doi:10.1145/362566.362568 · Cited by 285
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
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Metadata
- Authors
- Burstall, R. M.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1969-02-01
- Volume
- 12
- Issue
- 1
- Pages
- 41-48
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2159709550
- Cited by
- 324
- References
- 6
- FWCI
- 20.11
- Type
- journal article
- Language
- en
- Open access
- closed
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.