Re:Live Objects All the Way Down: Removing the Barriers Betw...
by pjc50 on Monday January 08, 2024 @04:45AM
(#38909915)
Type systems aren't programs because sensible type systems are decidable. They're very specifically not a programming language but a constraint language.
Now, there's also a case for compile-time programmability, but that is a feature that needs to be used carefully because it can make the question of what code is actually running very opaque, as well as arbitrarily increasing compile time. (C++, the bad bits)
> making compilation a program that you write wherein you can fully introspect your program
I'm experimenting with C# source generators at the moment, and wondering if there are any breakthrough features we could add this way by making it fully generalizable. (They have the limitation that they are additive-only, you can't mutate existing source)
https://3fx.ch/typing-is-hard.html ; more people should understand Hindley-Milner.
Now, there's also a case for compile-time programmability, but that is a feature that needs to be used carefully because it can make the question of what code is actually running very opaque, as well as arbitrarily increasing compile time. (C++, the bad bits)
> making compilation a program that you write wherein you can fully introspect your program
I'm experimenting with C# source generators at the moment, and wondering if there are any breakthrough features we could add this way by making it fully generalizable. (They have the limitation that they are additive-only, you can't mutate existing source)