lambda calculus


Also found in: Encyclopedia, Wikipedia.

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 ?
As stated in the title, this project will focus upon utilising the differential lambda calculus' inherent resource-sensitivity to study resource-limited computation from a semantic angle.
The eight papers introduce the principles of constructive functional analysis and predicativity, the theory of computable functionals and provable computability, the data structures of lambda calculus, and the handling of the proof assistant Minilog across to the reader.
This paper aims to demonstrate the usefulness of formal logic and lambda calculus in database programming.
Alongside, Alonzo Church's Lambda Calculus became the calculating equivalent of Turing Machines, wherein a variable was bound to specific functions or executable equations to carry out operations.
Barendregt, The Lambda Calculus: Its Syntax and Semantics, vol.
Barendregt, The Lambda Calculus: Its Syntax and Semantics (Amsterdam: North-Holland Press, 1984).
There, Alonzo Church was defining Lambda calculus (which later formed the basis of the Lisp programming language).
Many notations from the lambda calculus have been adopted in the EP data model.
Tanaka-Ishii argues the role of the signifier within a sign through consideration of a minimal computer language framework, the lambda calculus, and shows the degree to which sign models specify the design of a computer program ontology.
Thirty-nine papers and four invited talks from the August 2006 symposium report the results of recent research on logics of programs, proof theory, complexity, concurrency, pushdown systems, model theory, temporal logics, lambda calculus, stochastic systems, verification, and approximations.
Existing development tools are based on procedural programming languages, which are constrained by a set of mathematical rules set out in "lambda calculus." That describes how you can build procedural programming languages, and hence defines the boundaries of what can be created in most programs.
1989], the polymorphic lambda calculus [Reynolds 1974].