Combinatory logic is a branch of mathematical logic and theoretical computer science that deals with the study of combinators, which are basic, higher-order functions that can be combined to manipulate and transform data. It was introduced by the mathematician Haskell Curry and is closely related to lambda calculus. Key concepts include: 1. **Combinators**: These are abstract entities that combine arguments to produce results without needing to reference variables.
Articles by others on the same topic
Combinatory logic describes computation by application and fixed combinator constants, eliminating bound variables through bracket abstraction. Its intensional weak reduction does not identify every pair of terms that becomes beta-equivalent after translation into lambda calculus.