High Quality Content by WIKIPEDIA articles! Indirect self-reference describes an object referring to itself indirectly. For example, define the function f such that f(x) = "x(x)". Any function passed as an argument to f is invoked with itself as an argument, and thus in any use of that argument is indirectly referring to itself. This example is similar to the Scheme expression "((lambda(x)(x x)) (lambda(x)(x x)))", which is expanded to itself by beta reduction, and so its evaluation loops indefinitely despite the lack of explicit looping constructs. (That behaviour derives from Scheme's eager evaluation rule. The equivalent expression in lambda calculus has no normal form, for the same reason, but is not otherwise as problematic as it is in Scheme.)

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.