Live briefing
Everything about 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 Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Structured program theoremA 5-minute orientation
- Pick up a classic book: From logic design to logic programmingThe most-reprinted book on the subject
- Read the landmark paper: Structured Theorem for Quantum Programs and its ApplicationsCited 3 times
- Go sideways: Single-entry single-exitA closely related topic
- Go sideways: Essential complexityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
From logic design to logic programmingDominique Snyers · 1987
Propositional logicH. Kleine Büning, Hans Kleine Büning · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Single-entry single-exit Single-Entry Single-Exit (SESE) regions are a fundamental concept in structured programming and control-flow analysis. A SESE region is a portion of a…
- Essential complexity Essential complexity is a numerical measure defined by Thomas J. McCabe, Sr., in his highly cited, 1976 paper better known for introducing cyclomatic complexity…
- Structured programming Structured programming is a programming paradigm characterized by source code that uses block-based source code structure to encode control flow such as…
- P′′ P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. It provided…
- Control flow In software, control flow (or flow of control) describes how execution progresses from one command to the next. In many contexts, such as machine code…
- Flowchart A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be defined as a diagrammatic representation of an algorithm…
- Control-flow graph In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during…
- Flow chart language Flow chart language (FCL) is a simple imperative programming language designed for the purposes of explaining fundamental concepts of program analysis…