This example uses what in Scheme is called tail recursion.
这个例子使用Scheme中所谓的尾递归（tail recursion）。
Lisp offers a performance optimization called tail recursion optimization.
Lisp提供一项称作尾部递归优化的性能优化技术。
To effect that transformation, you need to use a common XSLT technique known as tail recursion.
要实现这一转换，需要使用常用的被称为尾递归(tail recursion)的XSLT技术。
Haskell has two primary advantages when dealing with recursion: Haskell optimizes tail recursion, and Haskell is lazy.
在处理递归时，Haskell有两大优势：Haskell优化了尾部递归，Haskell是惰性的。
Tail recursion is a common technique in XSLT style sheets.
尾递归是xslt样式表中的常用技术。
Recent versions of GCC also include some tail-recursion optimizations under limited circumstances.
最新版本的GCC也包含了一些在受限环境下的尾部递归优化。
Recent versions of GCC also include some tail-recursion optimizations under limited circumstances.
最新版本的GCC也包含了一些在受限环境下的尾部递归优化。
应用推荐