3 ms·
I'm quite sure it's not. Statically-typed programs can recursively parse data, and they can also monadically (sequentially) parse data. The same is true of dyna
by yakshaving_jgt 7y ago
I'm quite sure it's not. Statically-typed programs can recursively parse data, and they can also monadically (sequentially) parse data. The same is true of dynamically-typed programs.
- kazinator 7y agoLikewise academically speaking, statically typed programs can simulate Universal Turing Machines, QED. If the detailed requirements describing the inputs require dynamic typing, then the statically typed program has to whip up a facsimile of that dynamic typing. It's not an implementation detail; it shows up in visible, testable system behaviors. And then, there you are, with the possibility of errors that are not caught at your compile time.
- yakshaving_jgt 7y agoI don’t get it. Why are you concerned with compile time? The debate that the article is addressing is the supposed difference of capabilities between programs written with static vs dynamic types, at runtime.
- kazinator 7y agoThe situation is not written entirely with static types if the run-time processing requires the expression of dynamic typing. That's based on some actual dynamic typing from the language, or else some ad hoc dynamic types cobbed together in the program itself.