The SKI combinator calculus is a combinatory logic system and a computational system that can be thought of as a reduced version of the untyped lambda calculus. It was introduced by Moses Schönfinkel and Haskell Curry, and all operations in lambda calculus can be encoded into it using binary trees with S, K, and I symbols as leaves. It is important in the mathematical theory of algorithms as it is a Turing complete language.
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