combinatory logic

Also found in: Wikipedia.

combinatory logic

A system for reducing the operational notation of logic, mathematics or a functional language to a sequence of modifications to the input data structure. First introduced in the 1920's by Schoenfinkel. Re-introduced independently by Haskell Curry in the late 1920's (who quickly learned of Schoenfinkel's work after he had the idea). Curry is really responsible for most of the development, at least up until work with Feys in 1958.

See combinator.
This article is provided by FOLDOC - Free Online Dictionary of Computing (
The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.

Combinatory Logic


a branch of mathematical logic that studies combinators and their properties. The function and the operation of applying a function to an argument are the fundamental concepts in combinatory logic. Members of a certain class of operations on functions that is closed with respect to application are called combinators. The concept of “combinatorily defined function” as formulated using the terms of combinatory logic was one of the first methods of refining the concept of algorithm. The foundations of combinatory logic were worked out by the Soviet mathematician M. I. Sheinfinkel’ (Schönfinkel; 1924). Most of its results belong to the American logician H. Curry. Combinatory logic finds extensive application in the theory of programming languages.


Ianovskaia, S. A. “Logika kombinatornaia.” In the book Filosofskaia entsiklopediia, vol. 3. Moscow, 1964.
Schönfinkel, M. “Über die Bausteine der mathematischen Logik.” Mathematische Annalen, 1924, vol. 92.
Curry, H. B., and R. Feys. Combinatory Logic. Amsterdam, 1958.
Curry, H. B. “Recent Advances in Combinatory Logic.” Bulletin de la Société mathématique de Belgique, 1968, vol. 20, no. 3.
The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.
References in periodicals archive ?
Unlike Rowe, Tafuri introduced a theoretical dimension into the analysis by describing Palladio's combinatory logic as producing an Eco-esque "open work," thereby presupposing a variable compliance with classical norms.
Another valuable direction in logic is combinatory logic with the contributions of M.I.
Her topics include main theorems, connections to lambda-calculi, dual and symmetric combinatory logics, and typed combinatory logic.
Kolodner of the Georgia Institute of Technology, who presented "How Can We Help People Develop Their Creativity?" The special track invited speakers were Anthony Cohn of the University of Leeds, presenting "A Qualitative Spatiotemporal Approach to Activity Recognition and Object Classification"; Jean-Pierre Descles of the Universite de Paris-Sorbonne, who presented "Reasoning in Natural Language Using Combinatory Logic and Topology"; Sidney D'Mello of the University of Memphis, who presented "Emotion Detection and Emotionally Sensitive Computer Tutoring"; Dany Guevara of Electronic Arts, who presented "How AI Is Applied to Commercial Games"; and David Poole of the University of British Columbia, who presented "What Should the World-Wide Mind Believe?
The discipline of combinatory logic [Curry 1930; Schonfinkel 1924] began in the study of foundations of mathematics.
Part Two is an exposition of various systems of paraconsistent logic: dynamic dialectical logics, combinatory logics, discussive logics, and relevance logics.