使用归纳数据编写递归过程非常简单。
With inductive data, it is fairly easy to write recursive procedures.
对更复杂的递归过程来说这是一个通用的模式。
This is a common pattern for more complex recursive procedures.
本文对直接递归过程与间接递归过程的谓词变换语义给出了形式化的定义。
This paper presents the formal definitions of predicate transformer seman-rics for both direct and indirect recursive procedures using the concept of WP.
在编写递归过程时，应非常细心地进行测试，以确保它总是能满足某些限制条件。
If you write a recursive procedure, you should test it very carefully to make sure it always meets some limiting condition.
本文还从递归过程程序变换的观点，对几种目前广泛使用的程序设计语言作了若干评论。
In viewpoint of program translation some comments on the present widely applied programming languages were made.
简单的非递归过程表达式并不能访问所有的元素，尽管许多库都包含有帮助功能，可以用于遍历树。
No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.
在我们的示例流程中，该递归过程是无限的；subprocess3总会再次调用Mainprocess。
For our example process, the recursion is infinite; Subprocess 3 always invokes Main process again.
通过对递归过程的研究，给出由递归过程转化为非递归过程的规则，并且通过例子说明如何运用规则进行递归过程转化。
The paper provides regulations for the conversion from recursive procedure to non recursive procedure and illustrates with examples the use of the regulations.
它也不是一个直观的过程；当我们指挥别人做事的时候，我们极少会递归地指挥他们。
It's also not an intuitive process; when we give instructions to other people, we rarely direct them recursively.
每个装入的类都可能拥有其它所依赖的类，所以装入过程是递归的。
Each class that gets loaded may have other classes that it depends on, so the loading process is recursive.
一旦检测到循环，就会设置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.
通过使用 **/，还可以搜索子目录；该过程是递归的，例如find命令，以便您能产生 find 命令的等效结果，例如 $ find. -name "*.c"。
Subdirectories can also be searched by using **/; the process is recursive, such as the find command, so that you can produce the equivalent of a find command, such as $ find . -name "*.c".
这在fork-join问题实现中很常见，因为递归分解问题的过程将会创建大量的新Problem对象。
This is typical of fork-join problem implementations because the process of recursively dividing the problem will create a potentially large number of new Problem objects.
根据Wikipedia：递归（拉丁语recurrere->currere =run和re =return）是以自相似性的方式循环某些项的过程。
According to Wikipedia: Recursion (lat. recurrere -> currere = run and re = return) is the process of repeating items in a self-similar way.
也会向下递归到开始目录，并在此过程中添加相应的文件。
It will also recurse down from the starting directory, adding files as it goes.
它递归地遍历一组目录，在这个过程中应用样式表。
It recursively walks through a set of directories, applying the style sheet as it goes along.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
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.
我们则跳过比猜想数小的那个区间,然后我们重复这一过程,跟之前我们讲过的，递归思想非常类似,我们解决问题的时候,先把问题一步步变小，然后解决小问题。
So this is very similar, this is a kind of recursive thinking we talked about earlier, where we take our problem and we make it smaller we solve a smaller problem, et cetera.
除了以上例子外，MTK还可以迁移使用了位置参数和命名参数、重载、递归之类的特性的过程。
In addition to these examples above, MTK migrates procedures that utilize features like positional and named parameters, overloading, and recursion.
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
它只做最基本的事：递归地遍历源目录，在此过程中将样式表应用到每个XML文件以产生html格式的网站。
It does only the most basic thing: it recursively walks through a source directory, applying a style sheet on every XML file along the way to produce the Web site in HTML.
在证明过程中，我将把程序的三个递归点分别称为R 1、R2和R3。
In the proofs, I will refer to the three recursion points of the program as R1, R2, and R3, respectively.
从业务过程或者业务模型开始着手，然后将之递归地分解成子过程或子模型，直到达到某些条件，再继续分解就会违反这些条件为止。
Starting from the business-process or a business model and decomposing that into sub-processes or sub-models recursively until some condition is met by which it can't be decomposed any further.
first能够去除列表的第一个元素，rest简化了将尾部递归(清单9中的递归类型)应用于列表其余部分的过程。
First can peel off the first element of the list, and rest makes it easy to apply tail recursion — the type of recursion in Listing 9 — to the rest.
调用自身的函数就是递归的；执行这种函数的过程就叫递归运算。
A function that calls itself is recursive; the process of executing it is called recursion.
递归：函数对自身进行调用的过程。
The process of calling the function that is currently executing.
如果逻辑上不要求运算符过程调用自身，请移除任何递归调用，或将其替换为不调用自身过程的语句。
If your logic does not require the operator procedure to call itself, then remove any recursive calls or replace them with statements that do not call their own procedure.
递归性是人的思维过程中普遍存在的动力机制。
Recursiveness is an ordinary power mechanism existing in the process of people's thinking.
该重构技术由递归检索过程及重构过程构成。
The reconstruction technique is composed of cataloging process and reconstruction process.
经过多次修改，目前也有管理结构化数据、动态数据配置、递归(过程调用自身)等等功能。
It has been revised several times and now includes capabilities for handling structured data, dynamic data allocation, recursions (procedures that call themselves), and other features.
应用推荐