Immutable containers have nice subtype relationships: arrays <= ordered dictionaries <= unordered maps <= weak maps <= functions.
Church encoding implies unlimited introspection of data. This breaks many nice things like private members and free theorems.
-
-
i meant strictly from a puristic standpoint, so that functions depend on nothing but functions in your relationship tree
-
i don't really understand tho how pure lambda calculus implies unlimited introspection. closures hide names.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.