An article exploring fixed point theory in compilation and program analysis, using examples like dead code elimination to illustrate how algorithm design often converges to least or greatest fixed points. The author draws an unexpected parallel to strike mandate voting systems among Quebec student unions, which can be modeled as monotone functions where Tarski's fixed point theorem applies.