Tail call optimization about oso HOT 4 OPEN

Hey @seanchen1991! While it would be awesome to have someone from the community contribute this, I think it would be tricky for someone outside the company without lots of context to pick up. If you’re interested in getting more involved, I’d suggest starting with issues tagged either "Good first issue" or "help wanted". I just tagged a bunch more :)

from oso.

This would allow us to optimize rules that make recursive calls as their last statement to not blow the polar stack.

eg

sum([], ans, ans);
sum([first, *rest], prev_ans, ans) if
	this_ans = first + prev_ans and
	sum(rest, this_ans, ans);
sum(lst, ans) if sum(lst, 0, ans);

from oso.

I'd also be interested in any other optimizations people think would be helpful for the rules they are writing.

from oso.

Out of curiosity, is this a feature that is open to being worked on by open source contributors?

from oso.