I'm curious to know the earliest paper that identifies Tarski's theorem
regarding the existence of least/greatest fixpoints of monotonic
functions on a complete lattice ("A Lattice Theoretical Fixpoint
Theorem and its Applications", Pacific J. of Math. 5, 285309, 1955) as
the basis for termination of the standard dataflow analysis algorithms.
An interesting thread about the use of the KnasterTarski theorems for programming language semantics.
Posted to theory by Ehud Lamm on 3/18/03; 11:02:26 AM

