SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped lambda calculus. It can be thought of as a computer programming language, though it is not useful for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language.
All operations in lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the symbol I is added only for convenience, and just the other two suffice for all of the purposes of the SKI system.
Although the most formal representation of the objects in this system requires binary trees, they are usually represented, for typesetability, as parenthesized expressions, either with all the subtrees parenthesized, or only the right-side children subtrees parenthesized. So, the tree whose left subtree is the tree KS and whose right subtree is the tree SK is usually typed as ((KS)(SK)), or more simply as KS(SK), instead of being fully drawn as a tree (as formality and readability would require).
Read more about SKI Combinator Calculus: Informal Description, Formal Definition, Connection To Intuitionistic Logic
Famous quotes containing the words ski and/or calculus:
“The goal for all blind skiers is more freedom. You don’t have to see where you’re going, as long as you go. In skiing, you ski with your legs and not with your eyes. In life, you experience things with your mind and your body. And if you’re lacking one of the five senses, you adapt.”
—Lorita Bertraun, Blind American skier. As quoted in WomenSports magazine, p. 29 (January 1976)
“I try to make a rough music, a dance of the mind, a calculus of the emotions, a driving beat of praise out of the pain and mystery that surround me and become me. My poems are meant to make your mind get up and shout.”
—Judith Johnson Sherwin (b. 1936)