3 ms·
We know a Turing machine can't model all aspects of concurrency because a Turing machine with threads can compute an integer of unbounded size while there's alw
by Konohamaru 6y ago
We know a Turing machine can't model all aspects of concurrency because a Turing machine with threads can compute an integer of unbounded size while there's always a bound on the greatest integer an unthreaded Turing machine can.
But this is all naval-gazing anyway. What's even the point of a purely-declarative OS when it's either gonna:
1. Act as a glorified C preprocessor for an imperative language like Haskell and its do-notation?
2. Look like brainfuck?
- jolux 6y agoHaskell with do-notation is not imperative, that’s a common misconception. It’s a special syntax for working within a monad that desugars to nested function calls. Typically declarative systems are interesting because it is easier to prove strong properties about them.
- Konohamaru 6y agoI agree. Declarative systems are interesting. I am not against studying, implementing, or understanding declarative OSes from an intellectual viewpoint. Rather, people generally speaking ignore that the declarative perspective is not teleological and doesn't reflect the teleology of an underlying OS. Imperative programs are so popular among "joe schmoe" average programmers because they have a clear teleology. People are willing to forgive that imperative programs are harder to formally reason about because they make the teleology clearer. But have you seen declarative code? Because it's like math formulas, each function needs the same kind of documentation in order to understand the teleology behind the function.