Examples of using Lambda calculus in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
See also deductive lambda calculus.
Lambda calculus is a consistent theory in its own domain.
A classic example is lambda calculus.
In the lambda calculus, x is a bound variable in the term M λx.
Curry's paradox may be expressed in Lambda calculus.
John's Lambda Calculus and Combinatory Logic Playground.
Its structure is determined by the limitations of lambda calculus.
There is no concept in lambda calculus of variable declaration.
This is true in general mathematics andit must be true in lambda calculus.
In the lambda calculus, a beta redex is a term of the form: λ x.
In untyped lambda calculus fixed-point combinators are not especially rare.
The Y combinator is an example of what makes the Lambda calculus inconsistent.
Lambda calculus allows recursion by passing the same function that is called as a parameter.
The Y combinator is an implementation of a fixed-point combinator in lambda calculus.
In the lambda calculus it is not possible to refer to the definition of a function in a function body.
This is the same general convention(left-associativity) as for multiple application in lambda calculus.
The implementation in lambda calculus is more difficult due to limitations in lambda calculus.
Note that the Y combinator is a particular implementation of a fixed point combinator in lambda calculus.
Lambda calculus and programming languages regard function identity as an intensional property.
The syntax of the simply typed lambda calculus is essentially that of the lambda calculus itself.
Alternately a function may be considered as a lambda term defined purely in lambda calculus.
For the lambda calculus mathematician, this is a consequence of the definition of lambda calculus.
Conversely, combinatory logic and simply typed lambda calculus are not the only models of computation.
Church used Lambda calculus, Turing an idealized computer, and later Emil Post in his approach, all of which are equivalent.
In this article the author uses arguments based on lambda calculus to show why software cannot be patented.
This is the core of the problem that Stephen Cole Kleene andthen Haskell Curry discovered with combinatory logic and Lambda calculus.
The lambda calculus was introduced by mathematician Alonzo Church in the 1930s as part of an investigation into the foundations of mathematics.
Z is based on the standard mathematical notation used in axiomatic set theory, lambda calculus, and first-order predicate logic.
Unlike lambda calculus, kappa calculus has no higher-order functions; its functions are not first class objects.