Examples of using 演算 in Chinese and their translations into English
{-}
-
Political
-
Ecclesiastic
-
Programming
进程演算的研究开始于1973年至1980年期间，与RobinMilner对连接系统演算(CCS)的开创性工作有关。
Research 马丁-洛夫开创的直觉类型论提出了依赖类型的概念，直接启发了构造演算（CoC）与LF逻辑框架的建立。
Martin-Löf's intuitionistic type theory developed 事实上，确定飞机数字面积的问题是演算历史发展的主要动机。
Indeed, the problem 这个方案的核心是由演算的，离散数学，概率，和统计，以补充由所选择的理论和应用的部件学生们。
The core of this program is composed of calculus, discrete mathematics, probability, and statistics, which complement the theoretical and applied components chosen by student s.为lambda演算找到模型的一个重要步骤是只考虑保证有最小不动点的那些函数(在这种偏序集合上)。
The important step to find a model for the lambda calculus is to consider only those functions(on such a partially ordered set) which are guaranteed to have least fixed points.有类型lambda演算是基础编程语言并且是有类型的函数式编程语言如ML和Haskell和更间接的指令式编程语言的基础。
Typed lambda calculi are foundational programming languages and are the base of typed functional programming languages such as ML and Haskell and, more indirectly, typed imperative programming languages.此外，在lambda演算中，概念比如3和*，不需要任何额外定义基本运算符或常量就可以表示出来。
Moreover, in lambda calculus, notions such as'3' and'∗{\displaystyle*}' can be represented without any need for externally defined primitive operators or constants.有依赖类型的lambda演算是直觉类型论、构造演算和逻辑框架（LF）的基础，它是带有依赖类型的纯lambda演算。
Lambda 有能力处理这种推理的第一个逻辑演算是弗雷格的概念文字，它是现代谓词逻辑的祖先，它通过变量约束的方式处理量词。
The first logical calculus capable of dealing with such inferences was Gottlob Frege's Begriffsschrift(1879), the ancestor of modern predicate logic, which dealt with quantifiers by means of variable bindings.它由AlonzoChurch和StephenColeKleene在20世纪三十年代引入，Church运用lambda演算在1936年给出判定性问题(Entscheidungsproblem)的一个否定的….
It was introduced by Alonzo Church and Stephen Kleene in the 1930s; Church used the lambda calculus in 1936 to solve the Entscheidungsproblem.在1930年代后期，邱奇和他的学生在普林斯顿发明了一个竞争的函数抽象的形式化，就是lambda演算，它比组合子逻辑更加流行。
In the latter 1930s, Alonzo Church and his students at Princeton invented a rival formalism for functional abstraction, the lambda calculus, which proved more popular than combinatory logic.这个演绎定理（DT）自身没有公式化为命题演算：它不是命题演算的定理，而是关于命题演算的一个定理。
This deduction theorem(DT) is not itself formulated with propositional calculus: it is not a theorem of propositional calculus, but a theorem about propositional calculus.各种有类型lambda演算系统包括简单类型lambda演算，Jean-YvesGirard的系统F，和ThierryCoquand的构造演算都有规范化性质。
Various systems of typed lambda calculus including the simply typed lambda calculus, Jean-Yves Girard's System F, and Thierry Coquand's calculus of constructions are strongly normalizing.在这个意义上，DT对应于自然条件证明推理规则，它是在本條目中提出的第二个例子的命题演算的一部分。
In this sense, DT corresponds to the natural conditional proof inference rule which is part of the first version of propositional calculus introduced in this article.简单类型λ演算，一种高阶逻辑；直觉类型论；系统F;LF经常用来定义其他类型论；构造演算及其衍生理论。
Simply typed lambda calculus which is a higher-order logic; intuitionistic type theory; system F; LF is often used to define other type theories; calculus of constructions and its derivatives.构造演算扩展了这个同构为在完全的直觉谓词逻辑中的证明，这包括了量化陈述（它也叫做"命题"）的证明。
The Calculus of Constructions extends this isomorphism to proofs in 我建议演算应包含一些要素：.
This calculus I suggest should contain a number of elements.演算引入并在整个过程中使用。
Calculus is introduced and used throughout the course.在表面上，lambda演算不允许这样。
On the face of it, lambda calculus does not allow this.Lambda演算中并没有变量声明的概念。
There is no concept in lambda calculus of variable declaration.
