What is the translation of " LAMBDA CALCULUS " in Chinese?

• lambda演算
• lambdacalculus的

Examples of using Lambda calculus in English and their translations into Chinese

What is Lambda Calculus?
什么是lambdacalculus？?

Lambda calculus can be used to define what is a computable function.
Lambda演算可以用来清晰的定义什么是一个可计算的函数。

So what exactly is lambda calculus?
什么是lambdacalculus？?

The lambda calculus can be called the smallest universal programming language.
Lambda演算可以被称为最小的通用程序设计语言。

Haskell is a purely-functional programming language based on lambda calculus.
Haskell,是一门纯粹的函数式的程序设计语言，它是基于LambdaCalculus的。

In the lambda calculus, Y g is a fixed-point of g, as it expands to g(Y g).
在lambda演算中，Yg是g的不动点，因为它展开为g(Yg)。

The purely functional programming language Haskell, based on lambda calculus.
Haskell,是一门纯粹的函数式的程序设计语言，它是基于LambdaCalculus的。

Lambda calculus can be called the smallest universal programming language of the world.
Lambda演算可以被称为最小的通用程序设计语言。

Fortunately, Alonzo Church, the genius who invented the lambda calculus worked out how to do that.
幸运的是，邱奇（AlonzoChurch），这个发明了lambda演算的天才，找出了做到这一点的办法。

Lambda calculus has greatly influenced functional programming languages, especially LISP.
Lambda演算对函数式编程有巨大的影响，特别是Lisp语言。

These combinators are extremely useful when translating predicate logic or lambda calculus into combinator expressions.
这些表达式在把谓词逻辑或lambda演算转换成组合子表达式的时候非常有用。

A lambda calculus expression is completely valid only when all of its variables are bound.
一个Lambda演算表达式只有在其所有变量都是绑定的时候才完全合法。

It was introduced by Alonzo Church and Stephen Kleene in the 1930s; Church used the lambda calculus in 1936 to solve the Entscheidungsproblem.
它由AlonzoChurch和StephenColeKleene在20世纪三十年代引入，Church运用lambda演算在1936年给出判定性问题(Entscheidungsproblem)的一个否定的….

Being based on lambda calculus ISWIM has higher order functions and lexically scoped variables.
因为基于lambda演算，ISWIM有高阶函数和词法辖域变量。

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.
在1930年代后期，邱奇和他的学生在普林斯顿发明了一个竞争的函数抽象的形式化，就是lambda演算，它比组合子逻辑更加流行。

The lambda calculus has greatly influenced the functional programming languages, especially LISP.
Lambda演算对函数式编程有巨大的影响，特别是Lisp语言。

To formulate such a denotational semantics, one might first try to construct a model for the lambda calculus, in which a genuine(total) function is associated with each lambda term.
要公式化这样一种指称语义，首先会尝试为lambda演算构造一个模型，在其中为每个lambda项关联上一个真正的(全)函数。

Church invents"lambda calculus" which today is an invaluable tool for computer scientists.
邱奇（Church）发明了“λ演算”，对于今天的计算机科学家是一件无价的工具。

The lambda calculus may be seen as an idealised functional programming language, like Haskell or Standard ML.
Lambda演算可视为函数式编程语言的理想化版本，如Haskell或ML语言。

This property is inherited from lambda calculus, where multi-argument functions are usually represented in curried form.
这个属性是从lambda演算继承而来的，其中多参数的函数通常以柯里形式表示。

The lambda calculus is a formal system designed to investigate function definition, function application, and recursion.
Lambda演算是一个形式系统，它被设计出来用来研究函数定义，函数应用和递归。

For example the dependently typed lambda calculus with a type of all types(Type: Type) is not normalizing due to Girard's paradox.
比如带有所有类型的一个类型（Type:Type）的依赖类型lambda演算由于Girard悖论而不是强规范化的。

Not all lambda calculus ideas transform to practice because lambda calculus was not designed to work under physical limitations.
但并非所有的lambda演算都被实现了，因为lambda演算原本不是为有物理限制的计算机设计的。

The Knights of the Lambda Calculus is a semi-fictional organization of expert Lisp and Scheme hackers.
Λ演算骑士团（英语：KnightsoftheLambdaCalculus）是一个由LISP专家和Scheme黑客组成的的半虚构组织。

In lambda calculus, functions are'first-class' citizens, i. e functions can be used as inputs or be returned as outputs from other functions.
在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演算找到模型的一个重要步骤是只考虑保证有最小不动点的那些函数(在这种偏序集合上)。

Not all lambda calculus ideas transform to practice because lambda calculus was not designed to work under physical limitations.
但也并非全部lambda演算都被应用到了实践中，因为lambda演算不是被设计为在物理局限下工作的。

Such a model would formalize a link between the lambda calculus as a purely syntactic system and the lambda calculus as a notational system for manipulating concrete mathematical functions.
这样一种模型将形式化作为纯语法系统的lambda演算和作为操纵具体的数学函数的符号系统的lambda演算之间的连接。

Moreover, in lambda calculus, notions such as'3' and'∗{\displaystyle*}' can be represented without any need for externally defined primitive operators or constants.
此外，在lambda演算中，概念比如3和*，不需要任何额外定义基本运算符或常量就可以表示出来。

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.
各种有类型lambda演算系统包括简单类型lambda演算，Jean-YvesGirard的系统F，和ThierryCoquand的构造演算都有规范化性质。