An abstract machine defined by Professor David Turner to evaluate combinator expressions represented as {binary graph}s. Named after the two basic combinators, S and K.

In addition suitable contents:
[ = ] [ abstract machine ] [ af ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ b ] [ ba ] [ bi ] [ binary ] [ bs ] [ by ] [ ch ] [ co ] [ com ] [ combinator ] [ D ] [ David Turner ] [ de ] [ du ] [ ed ] [ er ] [ es ] [ expression ] [ fi ] [ file ] [ gr ] [ graph ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ K ] [ Lex ] [ lu ] [ ma ] [ machine ] [ mo ] [ mod ] [ module ] [ N ] [ na ] [ ne ] [ ns ] [ om ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ se ] [ si ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tw ] [ ua ] [ va ] [ vi ]