Combinatory logic is a notation to eliminate the need for variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry and has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments.
Read more about Combinatory Logic: Combinatory Logic in Mathematics, Combinatory Logic in Computing, Summary of The Lambda Calculus, Combinatory Calculi, Undecidability of Combinatorial Calculus
Famous quotes containing the word logic:
“There is no morality by instinct.... There is no social salvation—in the end—without taking thought; without mastery of logic and application of logic to human experience.”
—Katharine Fullerton Gerould (1879–1944)