[tkahn6]

That's interesting. I can't tell if you're joking or not (I'm pretty sure the ability to loop is a requirement for Turing-completeness).

Do you mean like Lisp which favors recursive function (or lambda calculus which uses the Y-combinator :)?

[SkyMarshal]

That's what I assumed when I upvoted him. Recursion & lambda ftw.

[eru]

Indeed, I was aiming at recursion. (Though I mostly use combinators like foldr instead of naked recursion.)

On the other hand: You can see loops as a special case of recursion. Though I like languages that don't treat this special case as a special case.