No, because it compiles to Python. I suppose I could finagle some way to manage it for self-calls, by putting the whole function in a loop.
Although that would bind the function name earlier than usual for Python. In Python, you can (in theory) do this:
def fact(n,sofar):
if n<2:
return sofar
else:
return fact(n-1,n*sofar)
f=fact
fact=lambda n,sofar: 3
...whereupon f(7,1)==3. I suppose I wouldn't really mind if Adder broke that consistently, but I don't think I like the idea of breaking it only for functions that do self-tail-calls.