You are thinking of the Structured Program theorem, which demonstrates that a language with those features can compute any computable function.
As Wikipedia states, it was stated in this form by Corrado Böhm and Giuseppe Jacopini in 1966, but can be traced back further to regular languages.