This poster will introduce the abstract interpretation algorithm proposed by "Mohnen, M., 2002, April. A graph-free approach to data-flow analysis", that Julia's type inference routine is based on, along with a sample Julia implementation of it.
We will also explain how the original algorithm is partially wrong as well as how it can be fixed, and also hopefully present the corrected proofs of the algorithm's termination and correctness.