Immutable containers have nice subtype relationships: arrays <= ordered dictionaries <= unordered maps <= weak maps <= functions.
-
-
Replying to @TimSweeneyEpic
These aren't statements about a cleverly-designed class hierarchy, but about universal properties of data that hold under isomorphism.
2 replies 0 retweets 4 likes -
Replying to @daniel_carvalho
Useful. I see Haskell typeclasses as the most powerful and modular implementation of the underlying idea.
10:51 AM - 9 Jan 2017
0 replies
0 retweets
0 likes
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.