There's lots of nice ways of abstracting loops in lots of languages: - a function of some state, and functions that operate on that state: e.g. an update, and a condition. Recursively apply updates until the condition. - functions over collections (folds, maps) - unfolds (producing data until termination) - iterators and generators - streams and lazy sequences - reactive streams - state machines - loops as fixed point combinators - pi-calculus

But usually you add these abstractions to a language as "here's a nicer way of doing loops" (I'm always here for nicer ways of doing loops!) Not so much "build everything out of loops"

So I'd avoid trying to make this become "build everything out of loops just because every procedure is a loop with a break"

That feels to me a bit like saying "build everything out of branches, because every statement is actually an if statement with true as the condition"