SKI combinator calculus
Technique used in functional programming
The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it is not convenient for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language.
Nº Q857813 ★
Common · Knowledge
SKI combinator calculus
Technique used in functional programming
The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it is not convenient for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language.
From Wikipedia
The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it is not convenient for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language. It can be likened to a reduced version of the untyped lambda calculus. It was introduced by Moses Schönfinkel and Haskell Curry. All operations in lambda calculus can be encoded via abstraction elimination into the SKI calculus as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). I itself is redundant and can be expressed with S and K only, e.g. as SKK, but its use often makes the definitions shorter and easier to grasp.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Kruskal's algorithm
Minimum spanning forest algorithm that greedily adds edges
Nº Q797860 ★★
Not listed
-
S
Simply typed lambda calculus
Formal system in mathematical logic
Nº Q855192 ★
Not listed
-
Complex instruction set computer
Computer architecture predating or contrasting with reduced instruction set computer (RISC)
Nº Q189120 ★★
Not listed
-
Combinatorial optimization
Subset of mathematical optimization
Nº Q1333872 ★
Not listed
-
T
Turing completeness
Ability of a computing system to simulate Turing machines
Nº Q197970 ★★★
Not listed
-
C
Computational learning theory
Theory of machine learning
Nº Q2462783 ★
Not listed