递归在haskell中至关重要。 与命令式语言要求你去表达求解的方式不同，haskell更倾向于让你提供问题的描述。
Recursion is important to Haskell because unlike imperative languages, you do computations in Haskell by declaring what something is instead of declaring how you get it.
但是传统的微分等价递归算法精度低，并且利用数值差分来求解等价失效模式，计算量大。
But its computational accuracy is low, and the computational quantity is large when numerical difference is used to solve the equivalent failure mode.
本文论述了母函数与递归数列的关系，并探讨了用母函数求解递归数列的方法。
In this paper, we discuss the relation between master function and recursion, and the approach in solving recursive relation by master function.
应用推荐