another thing, closures acts as anonymous classes, and partial application yields naturally safe linear state sequences. f a -> b -> c you get three steps unt

another thing, closures acts as anonymous classes, and partial application yields naturally safe linear state sequences. f a -> b -> c you get three steps until all information is known and computation can happen you didn't have to define anything, didn't have to think about it, while in OOP you'd have class F: setA setB setC logicThatCanBeCalledAnytime here you either get a random logic with unknown a,b,c state or to think very carefully what states things should be or design safeguards around every methods to ensure things are known... (and AFAIK no mainstream OO language even makes an attempt at having metalevel state transition checks easy to define and ensure..) 9th circle of dante