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

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

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

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

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

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

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

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

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

2023). "Functional Bits: Lambda Calculus based Algorithmic Information Theory" (PDF). tromp.github.io. John's Lambda Calculus and Combinatory Logic Playground...

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

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

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

computer science, kappa calculus is a formal system for defining first-order functions. Unlike lambda calculus, kappa calculus has no higher-order functions;...

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

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

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

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

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

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

standard lambda calculus where substitutions are performed by beta reductions in an implicit manner which is not expressed within the calculus; the "freshness"...

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

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

logic, the Scott–Curry theorem is a result in lambda calculus stating that if two non-empty sets of lambda terms A and B are closed under beta-convertibility...

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