Hi, thanks -- this looks great!
Does it support tail recursion (in constant space)?
Does it support tail recursion (in constant space)?
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.My main resistance is that I've used languages where you have to use special syntax for a recursive function, and I hate it. But this isn't quite the same thing.
Python wouldn't be my first choice, and I'm unconvinced that Lisp-Py makes sense, but I'm sure you'll find ways to adapt it regardless.