inglês

alemão árabe catalão checo chinês coreano dinamarquês eslovaco espanhol farsi francês grego hebraico hindi húngaro inglês italiano japonês neerlandês polonês português romeno russo sueco tailandês turco ucraniano vietnamita

chinês

Definição alemão árabe catalão checo chinês coreano dinamarquês eslovaco espanhol farsi francês grego hebraico hindi húngaro inglês italiano japonês neerlandês polonês português romeno russo sueco tailandês turco ucraniano vietnamita

Favoritos

typed lambda

Tradução de "typed lambda" em chinês

Não foi possível encontrar esta entrada. Mostrando resultados aproximados. Verifique a ortografia ou proponha a adição deste termo ao dicionário.

类型lambda

类型的 lambda

In computer programming, the routines (functions, procedures, methods) of strongly typed programming languages closely correspond to typed lambda expressions.

在编程中，强类型编程语言的例程（函数，过程，方法）密切关联于有类型lambda表达式。

In the simply typed lambda calculus extended with recursive types, fixed-point operators can be written, but the type of a "useful" fixed-point operator (one whose application always returns) may be restricted.

带有扩展的递归类型的简单类型lambda演算，可以写出不动点算子，"有用的"不动点算子（它的应用总是会返回）的类型将是有限制的。

System T extends the simply typed lambda calculus with a type of natural numbers and higher order primitive recursion; in this system all functions provably recursive in Peano arithmetic are definable.

系统T向简单类型lambda演算扩展了自然数类型和更高阶的原始递归函数；在这个系统中在可证明在皮亚诺算术中是递归函数的所有函数都是可定义的。

The term simple type is also used to refer to extensions of the simply typed lambda calculus such as products, coproducts or natural numbers (System T) or even full recursion (like PCF).

简单类型也被用来称呼对简单类型 lambda 演算的扩展比如积、陪积或自然数（系统 T）甚至完全的递归（如PCF）。

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悖论而不是强规范化的。

Typed lambda calculi play an important role in the design of type systems for programming languages; here typability usually captures desirable properties of the program, e.g. the program will not cause a memory access violation.

有类型lambda演算在为编程语言设计新类型系统的时候扮演了关键性角色；这里类型能力通常捕获了程序想要的性质，比如程序不会导致内存访问违规。

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演算是基础编程语言并且是有类型的函数式编程语言如ML和Haskell和更间接的指令式编程语言的基础。

Based on work by Berardi on pure type systems, Henk Barendregt proposed the Lambda cube to systematize the relations of pure typed lambda calculi (including simply typed lambda calculus, System F, LF and the calculus of constructions).

基于Berardi的工作，Barendregt提议了Lambda立方体来系统化纯有类型lambda演算（包括简单类型lambda演算，系统F、LF和构造演算）之间的关系。

Simply typed lambda calculus which is a higher-order logic

简单类型λ演算，一种高阶逻辑；

A logical framework is based on a general treatment of syntax, rules and proofs by means of a dependently typed lambda calculus.

它基于了通过有依赖类型的lambda 演算方式的对语法、规则和证明的一般性处理。

That means that there are computable functions that cannot be defined in the simply typed lambda calculus (and similarly there are computable functions that cannot be computed in the calculus of constructions or System F).

这意味着有可计算函数不能在简单类型的 lambda 演算中定义（类似的有可计算函数不能在构造演算或系统 F 中计算）。

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.

简单类型λ演算，一种高阶逻辑；直觉类型论；系统F； LF经常用来定义其他类型论；构造演算及其衍生理论。