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.
;
дс тдрлими цюлютдажкию дроемжки аиакиохдйис лидр
http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi;