[teraflop]

That sounds like it's basically impossible to implement your own non-trivial data structures. You can only use the ones that are already in the standard library.

For instance, how would you represent a binary tree? What would the type of a node be? How would I write an "insert node" function, which requires that the newly-created node continues to exist after the function returns?

I'm not necessarily saying that this makes your language bad, but it seems to me that the scope of things that can be implemented is much much smaller than C++.