S-K reduction machine

S-K reduction machine

An abstract machine defined by Professor David Turner to evaluate combinator expressions represented as binary graphs. Named after the two basic combinators, S and K.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)