3 ms·
>He wanted to bring programming back to mathematical fundamentals, so it is simple to reason about. This is fine for academic CS, but can become a unicorn hunt
by TheOtherHobbes 11y ago
>He wanted to bring programming back to mathematical fundamentals, so it is simple to reason about.
This is fine for academic CS, but can become a unicorn hunt - of the worst kind - for real world applications.
>To find the right abstraction, so only the correct things become simple, is one of the hardest tasks.
This is very true, and underappreciated in CS. The problem is that every language has its own set of ready-made abstractions, libraries offer further abstractions, and philosophies - OOP, design patterns, functional programming - offer a further set.
For any given problem, all of these may be non-optimal.
CS could maybe spend the next fifty years working on a useful theory of abstraction design, instead of trying to bake assumptions about how abstractions are supposed to work into the tools we use.
I'd love to see a meta-language which could be used to reason about impedance matching between abstractions and problem sets. I'm not sure such a thing is possible - Haskell is some way along, kind of - but it would be an improvement on languages that make it hard to design new abstractions because they come with rigid assumptions about the kinds of operations that are possible with code and data.
You could argue no restrictions exist in Turing complete languages. But for many problems the limit isn't Turing computability, it's how easy it is to find/invent expressive abstractions that help make hard problems more tractable.