To solve complex constraints in numerical analysis, and in program analysis, we can use approximation techniques.

We use partial orders to describe approximation.

In numerical analysis the order is order on real numbers.

In program analysis states often have discrete structures, so our orders are more like subset relations.

We introduce lattices as particular kinds of partial orders and we study convering sequences in lattices.