Structured program theorem
Theorem about a certain class of control-flow graphs
In programming language theory, the structured program theorem, generally called the Böhm–Jacopini theorem, states that a class of control-flow graphs can compute any computable function using only the following three control structures to combine subprograms :SequenceExecuting one subprogram, and then another subprogram
SelectionExecuting one of two subprograms according to the value of a boolean expression
IterationRepeatedly executing a subprogram as long as a boolean expression is true
Begin with the source’s own compact description: “Structured program theorem” is theorem about a certain class of control-flow graphs. The dossier treats that line as a proposition to test through Structured, program and theorem, not as a finished interpretation.
Why this record matters
The phrase “theorem about a certain class of control-flow graphs” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Jul 28, 2026.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Structured program theorem”, its source revision and the description used here.
- Expand the search: follow Structured program theorem primary sources, Structured program theorem archive and Structured research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Structured program theorem”?
- Which institution is responsible for the underlying evidence?
- Which cited source is closest to the event, object or claim?
Search terms from this dossier
This entry incorporates text from “Structured program theorem” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.