lambda calculus

(redirected from Abstraction operator)
Also found in: Encyclopedia.

lambda calculus

n
1. (Logic) logic computing a formalized description of functions and the way in which they combine, developed by Alonzo Church and used in the theory of certain high-level programming languages
2. (Computer Science) logic computing a formalized description of functions and the way in which they combine, developed by Alonzo Church and used in the theory of certain high-level programming languages
[C20: from the use of the symbol lambda (λ) to represent the mathematical functions]
Translations
lambda kalkul
lambdakalkyyli
lambda račun
Mentioned in ?
References in periodicals archive ?
In particular I shall set out a language of first-order predicate tense logic with a now predicate, and a first order (extensional) language with an abstraction operator, in such a way that each language can be shewn to be exactly translatable into the other.
Termination is usually obtained by using a suitable abstraction operator, defined as follows:
An abstraction operator is an operator which maps every finite set of atoms to a finite abstraction of it.
i]) where abstract is an abstraction operator let i : = i + 1; until [A.
In itself the use of an abstraction operator does not yet guarantee global termination.
The abstraction operator examines the set of atoms to be partially deduced and then decides which atoms should be abstracted and which ones should be left unmodified.
An abstraction operator which takes these trees into account will notice their similar behavior in the context of [P.
A General Theory of Abstraction Operators, NEIL TENNANT
The author presents a general theory of abstraction operators, which treats them as variable-binding, term-forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction.