2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32301This paper presents a method for computing a least fixpoint of a system of equations over booleans. The resulting computation can be significantly shorter than the result of iteratively evaluating the entire system until a fixpoint is reached.15 pagesProgramming LanguagesLogic in Computer ScienceSoftware EngineeringD.2.4; D.3.1; F.3.1; F.3.2; F.4.1text