| slovo | definícia |
eta reduction
(foldoc) | eta conversion
eta abstraction
eta expansion
eta reduction
In lambda-calculus, the eta conversion rule states
\ x . f x f
provided x does not occur as a free variable in f and f is a
function. Left to right is eta reduction, right to left is
eta abstraction (or eta expansion).
This conversion is only valid if bottom and \ x . bottom are
equivalent in all contexts. They are certainly equivalent
when applied to some argument - they both fail to terminate.
If we are allowed to force the evaluation of an expression in
any other way, e.g. using seq in Miranda or returning a
function as the overall result of a program, then bottom and
\ x . bottom will not be equivalent.
See also observational equivalence, reduction.
|
| | podobné slovo | definícia |
beta reduction
(foldoc) | beta reduction
[lambda-calculus] The application of a {lambda
abstraction} to an argument expression. A copy of the body of
the lambda abstraction is made and occurrences of the {bound
variable} being replaced by the argument. E.g.
(\ x . x+1) 4 --> 4+1
Beta reduction is the only kind of reduction in the {pure
lambda-calculus}. The opposite of beta reduction is {beta
abstraction}. These are the two kinds of beta conversion.
See also name capture.
|
|
Nenašli ste slovo čo ste hľadali ? Doplňte ho do slovníka.
na vytvorenie tejto webstránky bol pužitý dictd server s dátami z sk-spell.sk.cx a z iných voľne dostupných dictd databáz. Ak máte klienta na dictd protokol (napríklad kdict), použite zdroj slovnik.iz.sk a port 2628.
online slovník, sk-spell - slovníkové dáta, IZ Bratislava, Malé Karpaty - turistika, Michal Páleník, správy, údaje o okresoch V4