You are here: irt.org | FOLDOC | 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.
Nearby terms: SkipJack « SKOL « skolemisation « S-K reduction machine » skrog » SKsh » SKU
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL