Re:Dijkstra on the cruelty of really teaching computing scie...
by Hexstream on Monday September 06, 2010 @03:49PM
(#1667281)
However, a concise, expressive, very high-level domain-specific language can make it impossible to express many idioms that would break the semantics of the domain.
As an analogy (I hesitate to use one because of the article), you could have a high-level representation of HTML that would make it totally impossible to generate <HTML></NOTHTML>, which is not the case if you use a general-purpose system. (not a foolproof analogy but anyway)
Re:Dijkstra on the cruelty of really teaching computing scie...
by dragoon on Monday September 06, 2010 @02:07PM
(#1667096)
On formal principles, we'd expect that robustness and expressiveness are inversely related, on the principle that low-entropy data can be recovered with better fidelity than dense data, but I think I can name a counterexample to this principle in practice: I think Haskell does a phenomenally good job of being both expressive and robust if we consider a practical definition of robust, whereby pain is not measured by likelihood of error but the cost of an error. Compile-time errors are extremely cheap in comparison to run-time errors.
You want an "almost right" program to fail, but you want it to do so at compile time. Runtime silent failure is the worst.
Whenever a language comparison pops up, there's always a large contingent of people who argue for the superiority of a language because ideas can be expressed more concisely in 'their' language, but that necessarily means that some small change will have a relatively large effect.
There's also robustness in the sense that, e.g., BitC was trying to be robust, and that's something that I think is promising.