3 ms·
Is this a joke? If your real world data doesn’t have a fixed schema representable in a type system how do you machine parse it?
by chillacy 7y ago
Is this a joke? If your real world data doesn’t have a fixed schema representable in a type system how do you machine parse it?
- fulafel 7y agoCheck out Rich Hickey on this, eg in the 10 years of Clojure talk (or the transcript). Static typing requires you to express things in a way that is easily formally provable by the type system. It's much easier to write correct code (=working parer) than the correctness proof in a limited type system. This goes for higher order operations on schemas / types too, eg schemas are easier to make composeable than types.