Examples of using Lambda calculus in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
His conclusion may be stated as saying that combinatory logic and lambda calculus cannot be made consistent as deductive languages,
In lambda calculus, functions are taken to be'first class values',
The lambda calculus was introduced by mathematician Alonzo Church in the 1930s as part of an investigation into the foundations of mathematics.
Lambda calculus allows recursion by passing the same function that is called as a parameter.
Since abstraction is the only way to manufacture functions in the lambda calculus, something must replace it in the combinatory calculus. .
Z is based on the standard mathematical notation used in axiomatic set theory, lambda calculus, and first-order predicate logic.
other connectives of the logic and other constructions of simply typed lambda calculus.
Howard's correspondence naturally extends to other extensions of natural deduction and simply typed lambda calculus.
other paradoxes arise in Lambda calculus because of the inconsistency of Lambda calculus considered as a deductive system.
Usage and notation==Z is based on the standard mathematical notation used in axiomatic set theory, lambda calculus, and first-order predicate logic.
A lambda calculus system with the normalization property can be viewed as a programming language with the property that every program terminates.
If one takes lambda calculus for this class of function,
A prime example is Dana Scott's model of untyped lambda calculus in terms of objects that retract onto their own function space.
An interpreter for the quantum lambda calculus was implemented using the functional programming language haskell.
If one takes lambda calculus as defining the notion of a function,
peculiar to combinatory logic; The lambda calculus, with the same expressive power as combinatory logic,
In the lambda calculus, a term is in beta normal form if no"beta reduction" is possible.
A lambda calculus mathematician may see the Y combinator applied to a function as being an expression satisfying the fixed point equation,
This replacement mechanism simplifies work in both combinatory logic and lambda calculus and would later be called currying,
In the lambda calculus there are a number of combinator(implementations)