4 ms·

What are those deep principles?

• agumonkey 11y ago
  Factorization of logical dependencies (normalization) is a generic form of object modeling. Logical regression over function yields combinators. (like how one derives Y from factorial) Thinking in terms of properties instead of memory, unless you reach interface only OOP you don't do it (OOP in the Java/UML sense gives you rope to bike shed to no end, effectful constructors, is it composition, aggregation ... a never ending well) The notion of eta conversion, that I see as a generalized form of 'unnecessary wrapping' (if true then true else false and such) that is clean and well expressed in FP and full of bolts in Java (anonymous classes are too verbose, .Net had delegates for this I believe but it's named as yet another kind instead of an equivalence). Linked to reliance on temporaries instead of combinators a = f .. b = g a c = k c return c instead of simply (k . g . f) a (or a |> g |> ... for reading order ) ps: I encourage people to read books like Programming in Haskell from Graham Hutton (this book deals with average problems, not too sophisticated alienating ideas) to get a feel on how so many things can be re-expressed as composition.