Not being Turing Complete makes it less than the lambda calculus, which is still consistent with "purely functional". Purely functional is about expressive power you can't have, not power you can. So take the lambda calculus and restrict it, it remains purely functional.
Yeah right, but that makes a bar stool into a purely functional language as well; so the point is kinda pedantic.
Not being able to recurse makes the language awful to use for almost everything excepted simple substitution, which is effectively what it is used for.
