Schönfinkel's combinators
- lambda calculus
- logic
Moses Schönfinkel showed in the 1920s how bound variables could be eliminated from suitable logical expressions using a small basis of combinators. Application and fixed combinatorial rules could express behavior otherwise written through abstraction. The work supplied a foundational route to variable-free function representation and influenced Curry’s later development of combinatory logic. Its relationship to point-free programming is conceptual and historical, not a claim that every tacit language directly implements the same formal calculus. The achievement concerns expressive structure, not merely omitting names for stylistic brevity. **Timeline anchor:** 1 January 1924 CE. Year of publication (lecture 1920). **References:** [Source 1](https://en.wikipedia.org/wiki/Moses_Schönfinkel), [Source 2](https://en.wikipedia.org/wiki/Combinatory_logic).
Sources
Related
On other timelines
- Schönfinkel publishes variable elimination with combinators on Tacit programming · combinators, arrays, stacks and composition by @athan