In mathematical logic, the lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and...

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...

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...

mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by Michel Parigot. It introduces two...

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...

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...

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

language and in various logics, including certain forms of set theory, lambda calculus, and combinatory logic. The paradox is named after the logician Haskell...

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

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

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

shares several similarities with lambda calculus, particularly in how it handles functions and data. In lambda calculus, functions are first-class citizens...

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

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

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

z)((\lambda w.www)(\lambda w.www)(\lambda w.www)(\lambda w.www))\\\rightarrow &(\lambda x.z)((\lambda w.www)(\lambda w.www)(\lambda w.www)(\lambda w.www)(\lambda...

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

the concepts of lambda calculus. λ indicates an eigenvalue in the mathematics of linear algebra. In the physics of particles, lambda indicates the thermal...

lexical scope was similar to the lambda calculus. Sussman and Steele decided to try to model Actors in the lambda calculus. They called their modeling system...

conjunction with Alonzo Church's lambda calculus. One notable early example of type theory is Church's simply typed lambda calculus. Church's theory of types...

predicative calculus of inductive constructions (which removes some impredicativity)[citation needed]. The CoC is a higher-order typed lambda calculus, initially...

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...

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

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

being Befunge-93, named as such because of its release year. Binary lambda calculus is designed from an algorithmic information theory perspective to allow...

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

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

In lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor...

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