Re:The Emacs Problem
by mahmud on Tuesday May 25, 2010 @07:24AM
(#1377076)
"The language of GNU make is indeed functional, complete with combinators (map and filter), applications and anonymous abstractions. GNU make does support lambda-abstractions."
"Close to"? Not a formal proof of Turing-completeness (and may only work with GNU make, not sure), but...