# Lambda calculus

 related topics {math, number, function} {work, book, publish} {church, century, christian} {style, bgcolor, rowspan}

In mathematical logic and computer science, lambda calculus, also written as λ-calculus, is a formal system for function definition, function application and recursion. The portion of lambda calculus relevant to computation is now called the untyped lambda calculus. In both typed and untyped versions, ideas from lambda calculus have found application in the fields of logic, recursion theory (computability), and linguistics, and have played an important role in the development of the theory of programming languages (with untyped lambda calculus being the original inspiration for functional programming, in particular Lisp, and typed lambda calculi serving as the foundation for modern type systems). This article deals primarily with the untyped lambda calculus.

## Contents

Full article ▸

 related documents P-adic number Determinant Lebesgue integration Formal power series Travelling salesman problem Binomial coefficient Discrete cosine transform Grothendieck topology Banach–Tarski paradox Pythagorean triple Red-black tree Original proof of Gödel's completeness theorem Μ-recursive function Riemann integral Group theory Lie group Big O notation Combinatorics Class (computer science) Linear programming Combinatory logic Relational model Wikipedia:Free On-line Dictionary of Computing/R - S Dedekind domain Orthogonal matrix Prolog Hilbert's tenth problem System of linear equations Laplace transform Quadratic reciprocity