News for hackers. Stuff that matters.
Re:The Magic of Partial Evaluation by amw-zero on Wednesday November 18, 2026 @08:11PM (#50554746)
> Third one is when you learn that the behavior of any imperative language (down to the working of the microprocessor data paths) can be fully represented in a pure functional rewrite language (without destructive assignment / cell state changes).

What no one is ever able to explain is: why is this a good thing?

The underlying machine does destructive assignment. The whole thing is a big mutable array. Why should we represent it in another way?

Re:The Magic of Partial Evaluation by AlotOfReading on Wednesday November 18, 2026 @08:46PM (#50555054)
The difficulty of a given problem changes depending on the perspective you're looking at it from. That's why understanding different models helps.

Optimizing deeply enough will eventually make any abstraction leaky though, so you'll never fully escape mechanical sympathy.

Re:The Magic of Partial Evaluation by naasking on Thursday November 19, 2026 @12:31AM (#50556399)
> Why should we represent it in another way?

Because different representations have different properties which lets you perform different transformations. All compilers even for imperative languages use some variant of SSA in their intermediate languages, for example.

Re:The Magic of Partial Evaluation by seanhunter on Thursday November 19, 2026 @01:11AM (#50556626)
Well one place where I’ve found this useful practically is it makes debugging much easier because you can see the evaluation of values as you step through the program. It’s also afaics the insight behind static single assignment form and all the compiler optimisations that enables https://en.wikipedia.org/wiki/Static_single-assignment_form
Re:The Magic of Partial Evaluation by cowlevel on Thursday November 19, 2026 @05:04AM (#50558152)
The described path is useful for applying mathematical thinking to a program, or for exploring several execution paths at a time (like fuzzing) or executing with backtracking, or stuff like that.
Re:The Magic of Partial Evaluation by snackbroken on Thursday November 19, 2026 @12:18PM (#50562961)
Every tool we bring to bear in programming, from control flow structures to type checking comes down to grappling with the fact that global mutable state is hard to reason about.

Viewing the CPU as a pure function from "state of the universe before a given clock cycle" to "state of the universe after said clock cycle" is not particularly helpful on its own, because you still need to care about all the state in the universe. What this change in perspective does however, is that it becomes a relatively small change to say "actually this part of the program doesn't care about the whole universe, and doesn't affect the whole resulting universe, only that tiny bit over there matters and only this tiny bit over here changes."

The win is that the compiler can help keep you honest about handling every possible state you depend on as input and that when you call a function, it doesn't unexpectedly change some state your function depends on behind your back. All the state you ever have to care about when writing a pure function is "what are my arguments, and what are the return values of functions I call?"

Re:The Magic of Partial Evaluation by TuringTest on Friday November 20, 2026 @03:05AM (#50571576)
[delayed]