But isn't in fact Turing complete?
It has variables, control structures, loops and exceptions.
It has variables, control structures, loops and exceptions.
"You need some form of dynamic allocation construct (malloc ornew or cons will do) and either recursive functions or some other way of writing an infinite loop. If you have those and can do anything at all interesting, you're almost certainly Turing-complete." -- http://stackoverflow.com/a/449170
Which satisfies the infinite loop issue.
Have not looked carefully at the dynamic allocation, but I am guessing (hand waving here....) that it could be accomplished.