go-v.orgcodex
Menu
Page tools

codex · Philosophy

Combinatory logic

Combinatory logic is a notation to eliminate the need for quantified 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, which were introduced by Schönfinkel in 1920 with the idea of providing an analogous way to build up functions — and to remove any mention of variables — particularly in predicate logic. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments.

Wikipedia contributors, "Combinatory logic", Wikipedia, revision 1378677590, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex