这就是一个绝妙的递归定义。
我需要进行递归定义。
像这样的递归定义很快就会填满堆栈，从而导致堆栈溢出。
A recursive definition like this is going to fill up the stack rapidly and lead to a stack overflow.
如何找到复杂的递归定义的步骤是立方根的吗？
How to find complexity of a recursion where the step is defined in terms of a cube root?
重要的是，这是一个递归定义：有时属性将映射成零或者多列。
The important thing is that this is a recursive definition: at some point the attribute will be mapped to zero or more columns.
基于现有循环不变式开发技术中的递归定义思想，提出了开发复杂递归问题循环不变式的两种新策略；
Based on recursive definition idea in existing technique of developing loop invariants, two new strategies for developing loop invariants on complicated recursive problems are presented.
从某种程度上来说，这些概念在UML1 中对于协作的定义里可以找到，只可惜它们不能用于递归。
To a degree, these concepts could already be found in the UML 1 definition of collaborations, except that they were not applied recursively.
以递归的方式进行定义；例如，应用程序包括其他应用程序。
Is defined in a recursive manner; for example, if an application includes other applications.
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件 ——在这里是NULL指针。
Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.
原因：定义的某些基本例没有给出自己的类，然后以这种方法定义了递归数据类型。
Cause: The recursive datatype is defined in such a way that certain base cases of the definition are not given their own classes.
例如，可以为同一函数定义多种处理方式，还可以对递归调用应用模式匹配，这样做可以简化某些函数。
For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.
更严重的问题是类定义中可能存在多态递归。
The more serious problem is the potential for polymorphic recursion in class definitions.
可以通过修改清单4中定义的常量来改变最大递归深度。
You can adjust the recursion depth limit by changing a constant defined in Listing 4.
由于其复杂的结构，你可以对活动递归地进行分组并对流进行连接以形成更高的层，这种层次清晰地定义了输入和输出。
As with complex structures, you can recursively group activities and their interconnection flows into higher-level activities with clearly defined inputs and outputs.
探索模板的惟一方法是定义同样的递归版本以及基本案例。
The only way to go about exploring the template is to define a recursive version of the same along with a base case.
这种查找是递归的：如果在prototype 内定义的实例不能找到属性或函数，它就会在其原型中查找，依此类推。
This lookup is recursive: if the instance defined in prototype cannot find an attribute or function, it will look in its prototype, and so on.
在围绕g _ range参数所定义的全部可能范围构建签名时，check_dynamics函数将递归调用自身。
The check_dynamics function recursively calls itself while building signatures encompassing the full range of possibilities defined by the g_range parameter.
为了避免无限递归，Scala要求每一个辅助构造函数调用在它之前定义的构造函数[ScalaSpec2009]。
In order to avoid infinite recursion, Scala requires each auxiliary constructor to invoke another constructor defined before it [ScalaSpec2009].
在数学定义中，递归是十分常见的，如fibonacci数列(斐波那契数列)。
Definitions in mathematics are often given recursively. For instance, the Fibonacci sequence is defined recursively.
它被称为lambda演算，用于研究函数定义与应用程序以及递归概念。
Known as lambda calculus, it was designed to investigate the function definition and application, as well as the concept of recursion.
为了允许递归，协作结构被嵌套到类的规范中。这就是说这个类的所有实例都将有一个由类定义的内部结构。
To allow recursion, a collaboration structure is nested within a class specification, which means that all instances of that class will have an internal structure specified by the class definition.
这种类型的错误是这样产生的：定义的某些基本例没有被给出它们自己的类，然后以这种方法定义了一个递归的数据类型。
Bugs of this sort result from defining a recursive datatype in such a way that certain base cases of the definition are not given their own classes.
递归允许在域的更高层定义策略，然后将它们强制到内部所有组件实现和交互。
Recursion allows defining policies higher up in a domain and enforce them on all the component implementations and interactions within.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
Procedure calls can be nested or recursive, but the scope of a savepoint is restricted to the execution of the stored procedure in which it is defined.
对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
递归组合的思想很简单：可以通过组合现有的商业流程来定义新的商业流程（请参见图1）。
The idea of recursive composition is simple: new business processes can be defined by combining existing business processes (see Figure 1).
这是一个递归的定义，你怎么知道你的父母，至少其中一个是满足天生的美国公民，这个定义的呢？
How do you know that your parents, at least one of your parents satisfies the definition?
一旦检测到循环，就会设置cycle子句中已定义好的适当标记，并停止分支的递归查询过程。
As soon as a cycle is detected the appropriate flag defined in the cycle clause is set and the recursive query process for the branch is stopped.
递归实际上是定义一个调用自身的函数的方式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
递归实际上是定义一个调用自身的函数的方式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
应用推荐