Gesproken tekst vertalen, offlinefuncties, synoniemen, vervoegingen, educatieve spelletjes
Publiciteit
Registreer gratis: toegang tot meer resultaten en functies
simply typed lambda
Vertaling van "simply typed lambda" in Chinees
简单类型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演算扩展了自然数类型和更高阶的原始递归函数；在这个系统中在可证明在皮亚诺算术中是递归函数的所有函数都是可定义的。
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 中计算）。
For instance, the simply typed lambda calculus corresponds to the internal language of cartesian closed categories.
例如，简单类型λ演算 对应于笛卡儿闭范畴 （CCC）的内部语言。
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）。
Typed lambda calculi are closely related to mathematical logic and proof theory via the Curry-Howard isomorphism and they can be considered as the internal language of classes of categories, e.g. the simply typed lambda calculus is the language of Cartesian closed categories (CCCs).
它们通过Curry-Howard同构密切关联于直觉逻辑并可以被认为是范畴的类的内部语言，比如简单类型lambda演算是笛卡尔闭范畴（CCC）的语言。
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
简单类型λ演算 ，一种高阶逻辑 ；
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经常用来定义其他类型论； 构造演算及其衍生理论。
Synoniemen voor simply typed lambda in het Engels
Woord & uitdrukking van de dag
Afbeelding van de dag
Suggesties
Resultaten: 9. Exact: 9. Verstreken tijd: 31 ms.
