In a dynamic language, it is a great POO feature that an object is both prototype and instance: thus when building nested hierarchies of incrementally refined prototypes, you don't need to manually track the shape of the hierarchy to recursively instantiate all prototypes.
Even if you had static types for POO (a challenge in itself), distinguishing prototype and instance would mean writing all these instantiator functions... better to generate them with a macro... which must play well with the typesystem.
-
-
A static type system capable of inferring types for POO doesn't seem to exist yet. Surely, some encoding in dependent types is possible, but nobody seems to have done so yet, and then the question remains of how inferrable those types are. Challenge to static typists!
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
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.
Read my blog!