Definition
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
Related concepts
Arthur W. BurksBLISSBasic blockBitBlock (programming)Boolean data typeBrainfuckCOBOLCOBOL Structuring FacilityCharles H. Bennett (physicist)Code duplicationCommunications of the ACMComputable functionConsidered HarmfulControl-flow graphControl flowControl structureCorrado BöhmCyclomatic complexityDavid HarelDavid Watt (computer scientist)DecompilerDexter KozenDonald KnuthEdsger DijkstraEdsger W. DijkstraEdward YourdonEric S. RobertsEssential complexityFlow chartFlowchartForbidden graphFork (software development)General recursive functionGiuseppe JacopiniGotoHarlan MillsHenk BarendregtHerman GoldstineIBMInduced subgraphJACMJava (programming language)Java virtual machineJohn von NeumannJournal of the ACMKleene's T predicateKuratowski's theoremLabel (programming language)Mathematical folkloreNassi–Shneiderman diagramOperational semanticsOptimizing compilerPascal (programming language)Program counterProgram transformationProgramming language theoryProgramming paradigmPseudocodeP′′Radboud University NijmegenReversible computingRichard DeMilloS. Rao KosarajuSemantics (programming languages)Sheila GreibachSingle-entry single-exitSpaghetti codeStatement (programming)Stephen Cole KleeneStephen KleeneStructural inductionStructured programmingSubgraph isomorphism problemTuring completenessVon Neumann architectureZohar Manna
5 concepts already in your glossary