Combinator algebra has always struck me as a subject almost impossible to watch: it’s a lousy spectator sport but has a reputation of habit-forming as a participator sport. P. Freyd (1989, p.63)
Combinatory logic is a rephrasing of the lambda calculus that avoids explicit mention of variables and of lambda abstraction. Instead it uses combinators – in the most common case, they are traditionally called $S$, $K$, and $I$ – with the only other operation being application.
Since this move circumvents the necessity of variable management, combinatory logic is important for applications in computer science and linguistics.
Under the propositions as types correspondence, combinatory logic corresponds to the presentation of logic using a Hilbert system (instead of natural deduction or sequent calculus). There are versions of combinatory logic corresponding to linear logic and affine logic, generally called BCI logic and BCK logic (after the combinators they use).
The 1920s gave birth to several formal systems that permitted to base mathematics on the notion of function like e.g. the lambda calculus or von Neumann ‘set’ theory that eventually morphed into Neumann-Bernays-Gödel set theory. Notably the first of such systems was combinatory logic which was introduced by Moses Schönfinkel in 1920 (Schönfinkel 1924) and developed (partly independently) by Haskell Curry by the end of the decade.
Of course, a later such function based approach to mathematics is category theory and there has been in fact some interaction between combinatory logic and category theory (Bunder 1984). In 1972 when the connection between Cartesian closed categories and lambda calculus was an object of active research, Jim Lambek wrote:
Schönfinkel’s original program to base all of mathematics on combinatory logic can now be said to have been carried out by Lawvere in his many articles pursuing a categorical formulation of mathematics. (1972, p.57)
The basic combinators can be defined in terms of $\lambda$-calculus as
In simply typed lambda-calculus, these combinators are polymorphic with types
for arbitrary types $A,B,C$.
When combinatory logic is presented on its own rather than in terms of $\lambda$-calculus, the combinators are characterized by reduction rules that mirror their definition in terms of $\lambda$-abstractions:
Sometimes the combinator $I$ is omitted, as it can be defined from $S$ and $K$ as $I=S K K$.
The combinators $S$, $K$, and $I$ are used to encode $\lambda$-abstraction in the following way. If $M$ is a term in combinatory logic (perhaps containing variables), we define $\lambda x.M$ by induction over the structure of the term $M$.
(It is common to see this described with the second case given as “$\lambda x.M = K M$ whenever $M$ does not contain $x$ as a free variable”. However, this overlaps with the third case and is not structurally recursive. The above definition translates $\lambda x.y z$ to $S(K y)(K z)$, while the one with the free-variable-check produces $K(y z)$; both reduce to $y z$ when applied to any argument.)
Using this construction of an “abstraction operator” in the combinatory logic, we can then proceed to translate an arbitrary term of $\lambda$-calculus into combinatory logic by translating all the abstractions “from the inside out”. Formally, we crawl over the term and whenever we find an abstraction, we first recurse into its body, then we apply the above abstraction operator.
The construction of an abstraction operator in combinatory logic is analogous to a cut admissibility theorem; the resulting translation of $\lambda$-calculus into combinatory logic is then analogous to the corresponding cut-elimination theorem.
Versions of combinatory logic that correspond to linear logic and affine logic have been studied under the names BCI logic and BCK logic respectively, with the letters indicating the combinators used, where
The combinator $I$ is also definable as $CKK$, so it is also available in BCK logic (which might therefore be called BCKI logic). Similarly, traditional combinatory logic could be called “SKI logic”, or just “SK logic”.
Note that $B$ has the same type as the “composition” operation in a closed category, while $C$ has the type of a symmetry/exchange for a closed category. Similarly, $K$ is a sort of weakening rule while $S$ combines composition, symmetry, and contraction.
A partial combinatory algebra , also called a Schönfinkel algebra , is an algebraic structure that abstracts the structure of (partial) combinatory logic. They play an important role in the theory of realizability toposes.
Moses Schönfinkel, Über die Bausteine der mathematischen Logik , Math. Ann. 92 (1924) pp.305-316. (gdz) English translation with comments by Quine pp.355-366 in van Heijenoort (ed.), From Frege to Gödel , Harvard UP 1967.
M. W. Bunder, Category Theory Based on Combinatory Logic , Arch. Math. Logik 24 (1984) pp.1-15. (gdz)
Peter Freyd, Combinators , Contemp. Math. 92 (1989) pp.63-66. (pdf)
J. Roger Hindley, Jonathan P. Seldin, Lambda-Calculus and Combinators – An Introduction, Cambridge University Press (2008) [doi:10.1017/CBO9780511809835]
Jim Lambek, Deductive systems and categories III. Cartesian closed categories, intuitionist propositional calculus, and combinatory logic , pp.57–82 LNM 274 Springer Heidelberg 1972.
Last revised on February 28, 2023 at 14:28:42. See the history of this page for a list of all contributions to it.