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.

N="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 ]