Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application...

A typed lambda calculus is a typed formalism that uses the lambda-symbol ( λ {\displaystyle \lambda } ) to denote anonymous function abstraction. In this...

simply typed lambda calculus ( λ → {\displaystyle \lambda ^{\to }} ), a form of type theory, is a typed interpretation of the lambda calculus with only one...

Knights of the Lambda Calculus is a semi-fictional organization of expert Lisp and Scheme hackers. The name refers to the lambda calculus, a mathematical...

computation. Combinatory logic can be viewed as a variant of the lambda calculus, in which lambda expressions (representing functional abstraction) are replaced...

polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus, a mechanism...

intuitionistic version as a typed variant of the model of computation known as lambda calculus. The Curry–Howard correspondence is the observation that there is an...

{\displaystyle Y=\lambda f.\ (\lambda x.f\ (x\ x))\ (\lambda x.f\ (x\ x))} (Here we use the standard notations and conventions of lambda calculus: Y is a function...

extensional. In 1934, Haskell Curry noticed that the types used in typed lambda calculus, and in its combinatory logic counterpart, followed the same pattern...

In lambda calculus, the Church–Rosser theorem states that, when applying reduction rules to terms, the ordering in which the reductions are chosen does...

representing data and operators in the lambda calculus. The Church numerals are a representation of the natural numbers using lambda notation. The method is named...

logic and computer science, lambda is used to introduce anonymous functions expressed with the concepts of lambda calculus. Lambda indicates an eigenvalue...

basis for lambda calculus, a formal system used in mathematical logic and the theory of programming languages. The equivalence of two lambda expressions...

to computational theory Kappa calculus, a reformulation of the first-order fragment of typed lambda calculus Rho calculus, introduced as a general means...

Lambda calculus is a formal mathematical system based on lambda abstraction and function application. Two definitions of the language are given here:...

and algebraic laws, that is, to the algebraic study of data types. Lambda calculus-based languages (such as Lisp, ISWIM, and Scheme) are in actual practice...

systems of typed lambda calculus including the simply typed lambda calculus, Jean-Yves Girard's System F, and Thierry Coquand's calculus of constructions...

(also written lambda cube) is a framework introduced by Henk Barendregt to investigate the different dimensions in which the calculus of constructions...

the predicative calculus of inductive constructions (which removes some impredicativity). The CoC is a higher-order typed lambda calculus, initially developed...

evaluation of "closed" Lambda expressions in LISP and ISWIM's Lambda Closures. van Tonder, André (1 January 2004). "A Lambda Calculus for Quantum Computation"...

version of the untyped lambda calculus. It was introduced by Moses Schönfinkel and Haskell Curry. All operations in lambda calculus can be encoded via abstraction...

interpretation Curry–Howard correspondence Linear logic Game semantics Typed lambda calculus Typed and untyped languages Type signature Type inference Datatype...

the lambda calculus and Turing machines are equivalent models of computation, showing that the lambda calculus is Turing complete. Lambda calculus forms...

compensation for the risk borne in investment the α-conversion in lambda calculus the independence number of a graph a placeholder for ordinal numbers...

an extended Curry–Howard isomorphism between IPC and simply-typed lambda calculus. BHK interpretation Computability logic Constructive analysis Constructive...

foundations of theoretical computer science. He is best known for the lambda calculus, the Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem...

functions have exactly one argument. This property is inherited from lambda calculus, where multi-argument functions are usually represented in curried...

predates even the development of programming languages themselves. The lambda calculus, developed by Alonzo Church and Stephen Cole Kleene in the 1930s, is...

system. In the untyped lambda calculus, for example, the term ( λ x . ( x x ) λ x . ( x x ) ) {\displaystyle (\lambda x.(xx)\;\lambda x.(xx))} does not have...

The names "lambda abstraction", "lambda function", and "lambda expression" refer to the notation of function abstraction in lambda calculus, where the...