abstract:The structured program theorem, also called Böhm-Jacopini theorem, is a result in programming language theory. It states that a given class of algorithms can compute any computable function if those algorithms combine subprograms in only three specific ways.