出典:Wiktionary
出典:『Wiktionary』 (2025/04/14 01:27 UTC 版)
Coined by Alonzo Church after the use of the Greek letter lambda (λ) as the basic abstraction operator in the calculus.
lambda calculus (countable and uncountable, plural lambda calculi)
出典:Wikipedia
出典:『Wikipedia』 (2011/07/27 14:42 UTC 版)
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.