Combinatory logic is a notation that eliminates the need for variables in mathematical logic. It was introduced by Schönfinkel and Curry, and has been used in computer science as a model of computation and for designing functional programming languages. Combinators are higher-order functions that use function application and previously defined combinators to define results from arguments.
Stanford University
Fall 2022
Stanford University's CS 242 teaches the basics of programming language theory, its applications, and future trends. It focuses on the practical and theoretical understanding of programming languages, covering typed lambda calculus, state, monads, and more.
No concepts data
+ 15 more concepts