명사
Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions.
용법- 가산
- 불가산
- 관련 단어
- 예문
-
더 많은 예문 (1)
In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a Turing machine can be seen as an idealized, simplified model of computer hardware, the lambda calculus is more like a simple model of software.