On folk theorems
- 1 July 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 23 (7), 379-389
- https://doi.org/10.1145/358886.358892
Abstract
This paper is to refine this definitionsomewhat, adapting it to the purposes of the researchcommunity in computer science. Accordingly, we shallattempt to provide a reasonable definition of or, rather,criteria for folk theorems, followed by a detailed exampleillustrating the ideas. The latter endeavor might take oneof two possible forms. We could take a piece of folkloreand show that it is a theorem, or take a theorem andshow that it is folklore. As an example of the first formwe could ...Keywords
This publication has 36 references indexed in Scilit:
- A Comparison of Multilevel break and next StatementsJournal of the ACM, 1979
- Structured programming in CobolCommunications of the ACM, 1977
- A genealogy of control structuresCommunications of the ACM, 1975
- The new math of computer programmingCommunications of the ACM, 1975
- Flowchart techniques for structured programmingACM SIGPLAN Notices, 1973
- The Expression of Algorithms by ChartsJournal of the ACM, 1972
- Flowchart machinesBIT Numerical Mathematics, 1970
- Letters to the editor: go to statement considered harmfulCommunications of the ACM, 1968
- Böhm and Jacopini's reduction of flow chartsCommunications of the ACM, 1967
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966