lambda calculus


Also found in: Dictionary, Wikipedia.

lambda calculus

[′lam·də ‚kal·kyə·ləs]
(mathematics)
A mathematical formalism to model the mathematical notion of substitution of values for bound variables.
References in periodicals archive ?
Meanwhile, the foundation laid by Alan Turing, and also applicable to Church's Lambda Calculus (stated earlier), was worked upon by Church's student and American logician, John Barkley Rosser.
The pure lambda calculus is a well-known untyped system.
The lambda calculus is a untyped system that take a class of partial recursive functions as semantics.
This section describes a variant of the simply typed lambda calculus with two principals, a client and a host.
A good intuition for the semantics is to imagine two copies of the simply typed lambda calculus augmented with a new type t.
They want to improve their functional skills by understanding lambda calculus and improve de efficiency of programs by making them semantically transparent.
The research methodology consists of the literature study with the focus on the C++14 standard that allow implementation of lambda calculus.
The common framework considered here is a hierarchy of intermediate languages, all of which are subsets of the lambda calculus.
We show that our implementation of the lambda calculus is correct: For lambda terms with a normal form that contains no lambdas (ground terms), the implementation is shown to yield a lambda calculus normal form.
1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- Lambda calculus and related systems; I.
We show that Plotkin's CPS translation, Moggi's monad translation, and Girard's translation to linear logic can all be regarded as reflections from this source language, and we put forward the computational lambda calculus as a model of call-by-value computation that improves on the traditional call-by-value calculus.
PIM consists of the untyped lambda calculus extended with an algebraic data type that characterizes the behavior of lazy stores and generalized conditionals.