LambdaKalküls
The LambdaKalküls, commonly known in English as the lambda calculus, is a formal system in mathematical logic and computer science that models computation through function abstraction and application. It provides a minimal framework for defining and transforming computable expressions and serves as a foundational model for functional programming languages.
Its syntax consists of three elements: variables, abstraction (λx. M), and application (M N). A term can
Two main variants exist: untyped lambda calculus, which is highly expressive and may not terminate, and typed
LambdaKalküls is computationally universal: every computable function can be represented as a lambda-term, and, conversely, lambda
History and influence: Introduced in the 1930s by Alonzo Church, the lambda calculus has since become a