| 词汇 | lambda-calculus |
| 释义 | BETA lambda calculuscollocation in Englishmeanings of lambdaand calculusThese words are often used together. Click on the links below to explore the meanings. lambda noun[ C or U ] uk /ˈlæm.də/ us /ˈlæm.də/ the 11th letter of the ... See more at lambda calculus noun uk /ˈkæl.kjə.ləs/ us /ˈkæl.kjə.ləs/ mathematics specialized an area of advanced mathematics in which continuously changing values ... See more at calculus Examples of lambda calculuslambda calculus In this paper, we compare function definability in intersection type systems with function definability in the simply typed lambdacalculus. The next system is a lambdacalculus 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. So, unlike the case of simply typed lambdacalculus, two types can be convertible without being syntactically identical. However, even people familiar with lambdacalculus are often confused about the proper way of proving this fact. A small dependentlytyped lambdacalculus suffices for the effective encoding of most of math and, as we hope to justify, most of programming. Initially, we consider a simple language: the lambdacalculus augmented with mutually recursive let-bindings. Normalisation in lambdacalculus and its relation to type inference. Approximation theorems are an important tool in the analysis of the -theories induced by models of lambdacalculus. They are observationally equivalent, but cannot be proved equal in the call-by-value lambdacalculus. When applied to booleans, this construction yields the classical implementation of ifthen-else in lambdacalculus. We suggest another way of looking at the problem, which yields a sense in which the lambdacalculus is equivalent to an algebraic theory. Not coincidentally, though, the model we use was originally designed for the bounded higher-order lambdacalculus. Higher order abstract syntax is an abstract syntax representation that extends syntax trees with the abstraction mechanism of the lambdacalculus. Each set of equivalence classes is called a limited model of simply typed lambdacalculus. 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条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。