In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function whose argument is also a function. This mathematical discipline was subsequently termed combinatory logic by Curry and "λ-conversion" or "λ-calculus" by Church. Combinators can be used in the study of algebra, topology, and category theory, and have found application in the study of programs in algorithmic languages.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.