3 ms·
I'm not sure how this would look very different from current pure functional languages. Think about programming in Haskell. Everything is immutable but you can
by obblekk 13y ago
I'm not sure how this would look very different from current pure functional languages. Think about programming in Haskell. Everything is immutable but you can compile down to machine level binaries. So at some point the programmer is presented with an abstract immutable model and under the hood some runtime does real pointer arithmetic and all. Even garbage collectors could be optimized already for knowing that the programmer has no knowledge of memory locations.
If this kind of OS encourages hardware changes, that's one thing. But aside from performance, it probably won't look too different from current FP languages.
- thinkpad20 13y agoHe's not designing a language; he's designing an operating system.
- chongli 13y agoThe GHC RTS (used in most Haskell programs) is practically a mini-operating system already.