| 词汇 | lambda |
| 释义 | lambda noun[ C or U ] language, mathematics, scienceuk /ˈlæm.də/ us /ˈlæm.də/(symbolΛ, λ) the 11th letter of the Greek alphabet（希腊语字母表的第11个字母） Letters of alphabets aitch alphabet alphabetic alphabetical alphabetically alphabetization alphanumeric alphanumerically B, b I, i iota J, j K, k kappa Q, q rho S, s sigma T, t zeta Examples of lambdalambda It is clearly safe to set the update flag of every lambda-form to u, thereby updating every closure. Higher order abstract syntax is an abstract syntax representation that extends syntax trees with the abstraction mechanism of the lambda calculus. The standard method of proving this fact is via lambda representability of all (partial) recursive functions. Each set of equivalence classes is called a limited model of simply typed lambda calculus. This is in contrast to the simply typed lambda calculus and its extensions, which ignore type information at runtime. In this paper, we compare function definability in intersection type systems with function definability in the simply typed lambda calculus. While the relation to lambda lifting is apparent, the authors only conjecture that lifting and dropping are inverses. A system with higher order functions, for instance, necessarily has term variables because of lambda abstraction. The next system is a lambda calculus with function types and, optionally, cartesian products and disjoint unions. The self-interpreter we used for the one-level lambda-calculus was a direct implementation of the semantic rules in fig. 1 without the injections and projections. For a similar reason we also insist that there must be at least one lambda. So, unlike the case of simply typed lambda calculus, two types can be convertible without being syntactically identical. However, even people familiar with lambda calculus are often confused about the proper way of proving this fact. Indeed, configurations combine lambda abstractions (first-class functions), records, environments with mutually recursive definitions and modules. Indeed, we are currently working on adding just such syntactic sugar: lambdas, let-bindings, donotation for monads, etc. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
| 随便看 |
|
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。