您正在谈论建立尾部递归变换以计算斐波那契数的示例.您可以在 SICP的本章.

You are talking about established example of tail recursive transformation for computing Fibonacci numbers. You can find excellent description with code samples at this chapter of SICP.