News for hackers. Stuff that matters.
Re:The Kernel Programming Language by sparkie on Saturday March 02, 2019 @06:43AM (#19288806)
Certainly not with our existing type systems. It might be possible if somebody could come up with a new system with the vau calculus at its core rather than lambda calculus (as Hindley-Milner etc. are).

I think it would be a dead-end with kernel-standard though. The presence of mutability and cyclic data structures seems like the problem would be as unsolvable as the halting problem. For any serious investigation of type inference, you would probably need to stick to an immutable Kernel subset. The Kernel Report does make mutability optional.

Re:The Kernel Programming Language by CuriousSkeptic on Saturday March 02, 2019 @12:13PM (#19290029)
Hmm, I don’t see why vau-calculus should change things. Fexpr are more or less like expression trees in C# no? (Which are statically typed, at least where they compose with the rest of the program). Granted, dynamic languages in general can be a challenge, but TypeScript is a good argument for it being feasible at least.