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.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]