Re:Why Developers Never Use State Machines (2011)
by noblethrasher on Tuesday February 27, 2018 @12:12AM
(#16471223)
In 's4vi0r’s defense, “FP” usually means ML-style FP, which does happen to be pretty biased towards creating stack-based FSMs since it has literal syntax for stacks (list literals), states (discriminated unions + tuples), and transitions (pattern matching).
[ Parent
| on HN ]
Re:Why Developers Never Use State Machines (2011)
by coldtea on Tuesday February 27, 2018 @03:52AM
(#16472029)
>“FP” usually means ML-style FP
Only after sometime around 2010. Before that it was mostly Lisp and Scheme. Sometime around then, the trend around Haskell, purity, and co overtook them as what people mean when they talk about FP.