Whilst starting to learn lisp, I've come across the term tail-recursive.

虽然开始学习口齿不清，我遇到这个词的尾递归的。

youdao

If we could find a way to remove these unneeded stack frames, our tail-recursive functions would run in a constant stack size.

如果我们能找到一个除去这些不需要的栈结构的方法，那么我们的尾部递归函数就可以在固定大小的栈中运行。

youdao

Another difference is that, internally, the zipper version USES a linear tail-recursive traversal of the data structure instead of a recursive traversal.

另外一项差异在于，在zippers版本内部使用的是数据结构的线性尾递归遍历，而非递归遍历。

youdao

In Erlang there is no need for loops because tail recursive functions are transparently optimized to run in constant space.

而在Erlang中不需要使用循环，因为尾递归函数会被自动优化在固定的空间中运行。

youdao

In Erlang there is no need for loops because tail recursive functions are transparently optimized to run in constant space.

而在Erlang中不需要使用循环，因为尾递归函数会被自动优化在固定的空间中运行。

youdao